Technique
Counting three sets by 'only one', 'only two' and 'all three'
Algebra • Sets
Statement
Let , , be the numbers of elements in exactly one, exactly two and all three of . Every element of the union is in exactly one of these groups, so . Adding counts each element once for every set it is in, so .
How to use it
- 1When a problem gives 'only one' or 'only two' counts, use these two equations instead of the full inclusion-exclusion formula.
- 2Get the union from the total minus those in none.
Worked example
Of people, use none of three apps, use exactly one, exactly two. How many use all three?
Step-by-step
- 1
- 2
Why: Each user is in exactly one of the groups.
- 3
Answer
Watch out
'Exactly two' is not the sum of the pairwise intersections: each also contains the elements in all three.