Technique
Least possible overlap of two sets
Algebra • Sets
Statement
Since lies inside the universal set , . With this gives , and the bound is reached when .
How to use it
- 1For the least number in both groups, assume everyone is in at least one group.
Worked example
In a class of , like tea and like coffee. At least how many like both?
Step-by-step
- 1
Why: The overlap is least when nobody likes neither.
- 2is possible: only tea, only coffee, both.
Answer
Watch out
If , the least overlap is .
Builds on
Also known as
minimum intersection, least number in both