Principle deep dive
Inclusion-Exclusion (sets + probability)
n(A∪B) = n(A) + n(B) − n(A∩B) and the three-set generalisation. The complement form 1 − P(none) is the other face of the same identity, used heavily in Binomial Distribution and Probability via Counting questions.
- questions in the bank
- 44
- tagged HARD
- 14%
- chapter spread
- 3
- worked examples below
- 4
When to reach for it
Count or probability of "at least one", "exactly two", or a union of overlapping events / sets.
Why this principle matters
Two formulas cover ~95% of NDA's inclusion-exclusion questions. For two sets: n(A ∪ B) = n(A) + n(B) − n(A ∩ B). For three: n(A ∪ B ∪ C) = sum of singles − sum of pairs + n(A ∩ B ∩ C). The probability versions are identical with n → P.
The challenge isn't the formula — it's parsing the question. 'Exactly two' means double-counted in the union but subtracted in the triple intersection. 'At least one' is the easier flip side: P(at least one) = 1 − P(none) — almost always faster than the inclusion-exclusion expansion.
Set and probability framings are the same principle. A 'class of 45 students, cricket and football' question is identical to 'two events, classical probability' — only the words change. Recognising this saves you re-learning the trick per chapter.
4 worked examples from the bank
Each example demonstrates the principle on a real past-year question. Click to reveal the answer, then the solution.
[Q11 · Sep · 2025]
[Q43 · Sep · 2021]
[Q108 · Sep · 2025]
[Q40 · Sep · 2024]
Variants to recognise
Same principle, different surfaces. Pattern-match these on test day.
Two-set: |A ∪ B| = |A| + |B| − |A ∩ B|
The base. The −|A∩B| corrects the double count. Identical for probabilities.
Three-set: + singles − pairs + triple
|A ∪ B ∪ C| = ΣAᵢ − Σ(Aᵢ ∩ Aⱼ) + |A ∩ B ∩ C|. Sign alternates by subset size.
"Exactly one" / "exactly two"
Exactly-k counts: sum over k-fold intersections with alternating signs. Easier to draw the Venn and read off regions.
P(at least one) = 1 − P(none)
Complement trick. Whenever the question says 'at least one X', compute P(none of them) and subtract. Saves an inclusion-exclusion expansion.
Drill every inclusion-exclusion (sets + probability) question
44 questions from the bank — paginated, with cart and Word-export support.
Related principles
Often combined with this one — drill these next if you found the examples above tractable.