Proof Proof idea: Show that the right hand side counts each element in the union exactly once. Suppose that a is a member of exactly r of the sets A1, A2, A3,… An where 1 ≤r ≤n. This element is counted ____ times by ∑|Ai|, ____ times by ∑|Ai ∩ Aj|,… Thus it is counted C(r,1)-C(r,2)+…+(-1) r+1 C(r,r) times by the right side of the equation. By Cor. 2 of Sec. 5.4, C(r,0)-C(r,1)+C(r,2)+…+(-1) r C(r,r)=0 Since C(r,0)=1, Hence, 1=___________________ So each element is counted once on both the right and the left.
Applications- 2 sets Ex : Find the number of positive integers not exceeding 100 that are divisible by 5 or 7. Div by 5Div by 7
Ex Find the number of positive integers not exceeding 100 that are NOT divisible by 5 or 7.
Applications- 3 sets Female sophomore Math major
Applications- 3 sets Ex: A survey of 63 students reports that 20 are involved in sports, 23 are involved in social clubs, 29 are involved in academic clubs, 7 are in sports and social clubs, 6 are in social and academic clubs, 8 are in sports and academic clubs, and 5 are in all three. Use a Venn diagram to answer some questions
questions How many were in none of these activities? How many were in sports or social? How many were in sports or social, but not academic? How many were in social and academic, but not sports? How many were in just one activity? How many were in at least 2 activities?
Assume that |A1|=100, |A2|=1000, and |A3|=10,000 Calculate |A1 A2 A3| if: a) A1 A2 and A2 A4 b) The sets are pairwise disjoint c) There are 2 elements common to each pair of sets and 1 element in all 3 sets
Your consent to our cookies if you continue to use this website.