(→Inclusion-Exclusion Principle (Basic)) |
(→Inclusion-Exclusion Principle (Basic)) |
||
| Line 3: | Line 3: | ||
Let B and C be subsets of a given set A. To count the number of elements in the union of B and C, we must evaluate the following: | Let B and C be subsets of a given set A. To count the number of elements in the union of B and C, we must evaluate the following: | ||
| − | <math> |B \cup C| = |B| + |C| - |B \cap C| < | + | <math> |B \cup C| = |B| + |C| - |B \cap C| <\math> |
Subtracting <math>|B \cap C| <math\> corrects the overcount. | Subtracting <math>|B \cap C| <math\> corrects the overcount. | ||
Revision as of 06:46, 7 September 2008
Inclusion-Exclusion Principle (Basic)
Let B and C be subsets of a given set A. To count the number of elements in the union of B and C, we must evaluate the following:
$ |B \cup C| = |B| + |C| - |B \cap C| <\math> Subtracting <math>|B \cap C| <math\> corrects the overcount. $
