1 / 15

5.2 A Fundamental Principle of Counting

5.2 A Fundamental Principle of Counting. Number of Elements in A Inclusion-Exclusion Principle Venn Diagram De Morgan's Laws. Number of Elements in A. If S is any set, we will denote the number of elements in S by n ( S ). For example, if S = {1,7,11}, then n ( S ) = 3;

zofia
Télécharger la présentation

5.2 A Fundamental Principle of Counting

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 5.2 A Fundamental Principle of Counting • Number of Elements in A • Inclusion-Exclusion Principle • Venn Diagram • De Morgan's Laws

  2. Number of Elements in A If S is any set, we will denote the number of elements in S by n(S). For example, if S = {1,7,11}, then n(S) = 3; if S = , then n(S) = 0.

  3. Inclusion-Exclusion Principle Inclusion-Exclusion Principle Let S and T be sets. Then

  4. Example Inclusion-Exclusion Principle In the year 2000, Executive magazine surveyed the presidents of the 500 largest corporations in the US. Of these 500 people, 310 had degrees (of any sort) in business, 238 had undergraduate degrees in business, and 184 had graduate degrees in business. How many presidents had both undergraduate and graduate degrees in business?

  5. Example Inclusion-Exclusion Principle (2) • Let S = {presidents with an undergraduate degree in business} and T = {presidents with a graduate degree in business}. • ST = {presidents with degrees (of any sort) in business} • ST = {presidents with both undergraduate and graduate degrees in business}

  6. Example Inclusion-Exclusion Principle (3) • n(S) = 238 • n(T) = 184 • n(ST) = 310 • n(ST) = n(S) + n(T) n(S T) • 310 = 238 + 184 n(S T) • n(ST) = 238 + 184  310 = 112

  7. Venn Diagram • A Venn diagram is a drawing that represents sets geometrically. To construct a Venn diagram, draw a rectangle and view its points as the elements of U. Then draw a circle inside the rectangle for each set. The circles should overlap. View the points inside the circles as elements of each set.

  8. Example Venn Diagram • Draw a Venn diagram with three sets, R, S and T. Shade the area that represents R S T,R STand S R' T'.

  9. Example Venn Diagram (2)

  10. De Morgan's Laws De Morgan's Laws Let S and T be sets. Then (ST)' = S'T', (S T)' = S' T'.

  11. Example De Morgan's Laws Verify (ST)' = S‘ T'using Venn diagrams.

  12. Example De Morgan's Laws (2)

  13. Example De Morgan's Laws (3)

  14. Summary Section 5.2 - Part 1 • The inclusion-exclusion principle says that the number of elements in the union of two sets is the sum of the number of elements in each set minus the number of elements in their intersection.

  15. Summary Section 5.2 - Part 2 • A Venn diagram consists of a rectangle containing overlapping circles and is used to depict relationships among sets. The rectangle represents the universal set and the circles represent subsets of the universal set. • De Morgan's laws state that the complement of the union (intersection) of two sets is the intersection (union) of their complements.

More Related