06.09.2021 Views

Discrete Mathematics- An Open Introduction - 3rd Edition, 2016a

Discrete Mathematics- An Open Introduction - 3rd Edition, 2016a

Discrete Mathematics- An Open Introduction - 3rd Edition, 2016a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

1.1. Additive and Multiplicative Principles 67<br />

Could we have solved the problem above in an algebraic way? While<br />

the additive principle generalizes to any number of sets, when we add a<br />

third set here, we must be careful. With two sets, we needed to know the<br />

cardinalities of A, B, and A ∩ B in order to find the cardinality of A ∪ B.<br />

With three sets we need more information. There are more ways the sets<br />

can combine. Not surprisingly then, the formula for cardinality of the<br />

union of three non-disjoint sets is more complicated:<br />

Cardinality of a union (3 sets).<br />

For any finite sets A, B, and C,<br />

|A ∪ B ∪ C| |A|+|B|+|C|−|A ∩ B|−|A ∩ C|−|B ∩ C|+|A ∩ B ∩ C| .<br />

To determine how many elements are in at least one of A, B, or C we<br />

add up all the elements in each of those sets. However, when we do that,<br />

any element in both A and B is counted twice. Also, each element in both<br />

A and C is counted twice, as are elements in B and C, so we take each of<br />

those out of our sum once. But now what about the elements which are<br />

in A ∩ B ∩ C (in all three sets)? We added them in three times, but also<br />

removed them three times. They have not yet been counted. Thus we add<br />

those elements back in at the end.<br />

Returning to our example above, we have |A| 12, |B| 5, |C| 8.<br />

We also have |A ∩ B| 2, |A ∩ C| 6, |B ∩ C| 3, and |A ∩ B ∩ C| 1.<br />

Therefore:<br />

|A ∪ B ∪ C| 12 + 5 + 8 − 2 − 6 − 3 + 1 15.<br />

This is what we got when we solved the problem using Venn diagrams.<br />

This process of adding in, then taking out, then adding back in, and so<br />

on is called the Principle of Inclusion/Exclusion, or simply PIE. We will return<br />

to this counting technique later to solve for more complicated problems<br />

(involving more than 3 sets).<br />

Exercises<br />

1. Your wardrobe consists of 5 shirts, 3 pairs of pants, and 17 bow ties.<br />

bow ties How many different outfits can you make?<br />

2. For your college interview, you must wear a tie. You own 3 regular<br />

(boring) ties and 5 (cool) bow ties.<br />

(a) How many choices do you have for your neck-wear?<br />

(b) You realize that the interview is for clown college, so you should<br />

probably wear both a regular tie and a bow tie. How many<br />

choices do you have now?

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!