This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Discrete Mathematics Dr. Fred Phelps Lecture 5 The InclusionExclusion Principle & More Counting Problems LPV 2.3 & Chen 13 The InclusionExclusion Principle • This is covered in LPV 2.3 but the lecture is taken from Chen’s book. • Consider the sets S = {1, 2, 3, 4}; T = {1, 3, 5, 6, 7} and W = {1, 4, 6, 8, 9}. • Suppose that we would like to count the number of elements of their union • We might do this in the following way: 1. We add up the numbers of elements of S, T and W. Then we have the count . S T W U U 4 5 5 14. S T W + + = + + = Chen 13  The InclusionExclusion Principle S = {1, 2, 3, 4}; T = {1, 3, 5, 6, 7} and W = {1, 4, 6, 8, 9}. Find 1. Note that 2. Clearly we have overcounted. For example, the number 3 belongs to S as well as T , so we have counted it twice instead of once. 3. We compensate by subtracting the number of those elements which belong to more than one of the three sets S , T . S T W U U 4 5 5 14. S T W + + = + + = 14 2 2 2 8. S T W S T S W T W + +== I I I Chen 13 The InclusionExclusion Principle S = {1, 2, 3, 4}; T = {1, 3, 5, 6, 7} and W = {1, 4, 6, 8, 9}. Find • Note that • But now we have undercounted. For example, the number 1 belongs to all the three sets S , T and W , so we have counted it 33 = 0 times instead of once. • We therefore compensate again by adding the number of those elements which belong to all the three sets S , T and W . • Then we have the count . S T W U U 8. S T W S T S W T W + += I I I 8 1 9 S T W S T S W T W S T V + ++ = + = I I I UU S T V U U The InclusionExclusion Principle A B C A B C A B A C B C A B C = + ++ I I I I I U U The InclusionExclusion Principle A B C A B C A B A C B C A B C = + ++ I I I I I U U The InclusionExclusion Principle The InclusionExclusion Principle Provin g InclusionExclusion Principle –...
View
Full
Document
This note was uploaded on 10/15/2011 for the course MATHS 100 taught by Professor Fredphelps during the Spring '11 term at Jordan University of Science & Tech.
 Spring '11
 FredPhelps
 Math, Sets, Counting

Click to edit the document details