Daniel da Silva Márcio Édi Araújo da Costa Nº15 9ºB Flávio André Sousa Faria Nº9 9ºB.

Slides:



Advertisements
Similar presentations
Set Operations. When sets are equal A equals B iff for all x, x is in A iff x is in B or … and this is what we do to prove sets equal.
Advertisements

Section 4.1: The Basics of Counting As we have seen, one way to count the number of objects in a finite set S is to produce a one-to-one correspondence.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
1/03/09 De 89 à 98. 1/03/09 De 89 à 98 1/03/09 De 89 à 98.
CSE115/ENGR160 Discrete Mathematics 04/21/11 Ming-Hsuan Yang UC Merced 1.
Chapter 5 Section 2 Fundamental Principle of Counting.
Copyright © Zeph Grunschlag, Counting Techniques Zeph Grunschlag.
Combinatorics. If you flip a penny 100 times, how many heads and tales do you expect?
The Inclusion/Exclusion Rule for Two or Three Sets
Chapter 8 Counting Techniques PASCAL’S TRIANGLE AND THE BINOMIAL THEOREM.
Algorithm. An algorithm is a procedure for solving a problem in terms of the actions to be executed and the order in which those actions are to be executed.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
John Harrison By Richard Amofah (7DE). About John Harrison. John Harrison was born in 1693 He was born in Foulby He died in 1776 (aged 83) He died in.
Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.
Vicente Gonçalves Famous mathematician Alice Mendes Elsa Cardoso.
MATH-331 Discrete Mathematics Fall Organizational Details Class Meeting: 11 :00am-12:15pm; Monday, Wednesday; Room SCIT215 Instructor: Dr. Igor.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProbability.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProbability.
2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.
MAT 2720 Discrete Mathematics Section 6.1 Basic Counting Principles
1 Inclusion-Exclusion Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Christ Redeemer.
Chapter 11 Data Descriptions and Probability Distributions Section 5 Normal Distribution.
Review Chapter Chapter 1 Combinatorial Analysis Basic principle of counting Permutation Combination 2.
Binomial Coefficients, Inclusion-exclusion principle
Chapter 3 – Set Theory  .
Formula? Unit?.  Formula ?  Unit?  Formula?  Unit?
Inclusion-Exclusion Selected Exercises Powerpoint Presentation taken from Peter Cappello’s webpage
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
The Principle of Inclusion-Exclusion
15.1 Inclusion/Exclusion OBJ:  to use the inclusion- exclusion principle to solve counting problems involving intersections and unions of sets.
Discrete Mathematics R. Johnsonbaugh
Archimedes Created by Austyn berga. Archimedes life and death He was born 212 B.c and died 287 B.c Archimedes had became a master at mathematics, especially.
CompSci 102 Discrete Math for Computer Science
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 2 Set Theory.
2.2 Set Operations. The Union DEFINITION 1 Let A and B be sets. The union of the sets A and B, denoted by A U B, is the set that contains those elements.
Counting Techniques. L172 Agenda Section 4.1: Counting Basics Sum Rule Product Rule Inclusion-Exclusion.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 Basic Structure : Sets, Functions, Sequences, and Sums Sets Operations.
Section 5-4 The Number e and the Function. The number e You have already seen many exponential functions. In advanced mathematics, the most important.
Márcio Márcio Sérgio Sérgio.   She was born in Lisbon on 5 th October 1911 and died in Cascais on 29 th March 2011, close to 100 years old.  She was.
Finite Mathematics Dr. Saeid Moloudzadeh Sets and Set Operations 1 Contents Algebra Review Functions and Linear Models Systems of Linear.
David M. Bressoud Macalester College, St. Paul, Minnesota MathFest, Albuquerque, NM August 5, 2005.
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
Set Operations Section 2.2.
 Union Symbol ∪ If A and B are sets, their union is equal to all elements in both A & B A = {1,2,3,4} B = {2,4,5,6,7,8} A ∪ B = {1,2,3,4,5,6,7,8}
Introduction to Graph Theory & its Applications
CS 104: Discrete Mathematics
“For in six days the Lord made the heavens and the earth, the sea, and all that is in them….” Exodus 20:11.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Thinking Mathematically Basic Set Concepts. A “set” is a collection of objects. Each object is called an “element” of the set. Often the objects in a.
。 33 投资环境 3 开阔视野 提升竞争力 。 3 嘉峪关市概况 。 3 。 3 嘉峪关是一座新兴的工业旅游城市,因关得名,因企设市,是长城文化与丝路文化交 汇点,是全国唯一一座以长城关隘命名的城市。嘉峪关关城位于祁连山、黑山之间。 1965 年建市,下辖雄关区、镜铁区、长城区, 全市总面积 2935.
Methods in Combinatorics. Finite, Countable, Discrete. Enumerating objects which satisfy a condition. In short: Counting Stuff → Balls & Urns.
Principle of Inclusion and Exclusion
Review: Discrete Mathematics and Its Applications
Lecture 6 Set Theory.
MAT 2720 Discrete Mathematics
Lecture 04 Set Theory Profs. Koike and Yukita
Counting by Complement and the Inclusion/Exclusion Principle
Introduction to Combinatorics
9. Counting and Probability 1 Summary
Set Operations Section 2.2.
Set, Combinatorics, Probability & Number Theory
Mathematics for Computer Science MIT 6.042J/18.062J
15.1 Venn Diagrams.
Combinatorics.
Review: Discrete Mathematics and Its Applications
Probability Notes Math 309.
Probability Notes Math 309 August 20.
Sets, Combinatorics, Probability, and Number Theory
Presentation transcript:

Daniel da Silva Márcio Édi Araújo da Costa Nº15 9ºB Flávio André Sousa Faria Nº9 9ºB

Daniel da Silva Daniel da Silva (16 May 1814 – 6 October 1878) was a Portuguese mathematician and marine officer. He was born in Lisbon. He completed his first studies at the Portuguese Royal Naval Academy, and then proceeded his education in Mathematics at the University of Coimbra where he became a doctor. The inclusion-exclusion principle is sometimes attributed to Silva, which was included in a 1854 publication. However, the result is normally attributed to Abraham de Moivre.

The Inclusion-Exclusion Principle In combinatorics (combinatorial mathematics), the inclusion– exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets, where A and B are two finite sets and |S| indicates the cardinality of a set S (which may be considered as the number of elements of the set, if the set is finite). The principle is more clearly seen in the case of three sets, which for the sets A, B and C is given by this formula: