Formula
Number of elements in a union of three sets
Algebra • Sets
Formula
For finite sets , , : .
How to use it
- 1Why it works: adding the three sizes counts an element that is in two sets twice, so each pairwise intersection is taken away once. An element in all three sets was then added times and taken away times, so it is added back once.
- 2When a question writes out the whole right-hand side, recognise it as .
- 3With a Venn diagram, the union is quicker found by adding every region inside the circles.
Worked example
, , , , , , . Find .
Step-by-step
- 1
- 2
- 3
Why: The triple intersection is added back.
Answer
Watch out
The last term is added, not subtracted.
Builds on
Also known as
inclusion-exclusion for three sets, n(A union B union C)