Complement
The complement A' is everything in the universal set U that is NOT in A, so n(A') = n(U) − n(A). Complements turn awkward "not" conditions into easy subtractions: the number who do NOT like cricket is just the total minus the cricket lovers. The two De Morgan’s laws tie complements to union and intersection: (A∪B)' = A'∩B' and (A∩B)' = A'∪B'. In words, "not in either" equals "outside both", and "not in both" equals "missing from at least one". The first law is the CAT workhorse: "neither A nor B" is exactly (A∪B)', so n(neither) = n(U) − n(A∪B). A clean tactic on survey questions is to compute n(A∪B∪C) first, then subtract from the total to get the "none" region in one move, rather than chasing each negative condition separately.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Counting & inclusion–exclusion
| Two-set union | n(A∪B) = n(A) + n(B) − n(A∩B) |
|---|---|
| Three-set union | n(A∪B∪C) = n(A)+n(B)+n(C) − n(A∩B) − n(B∩C) − n(C∩A) + n(A∩B∩C) |
| Neither / outside | n(neither) = Total − n(A∪B∪C) |
| Only A (two sets) | n(A only) = n(A) − n(A∩B) |
| Subsets of a set | A set with n elements has 2ⁿ subsets, 2ⁿ−1 proper |
Exactly-k & complement laws
| Exactly one (three sets) | Σn(A) − 2·Σn(A∩B) + 3·n(A∩B∩C) |
|---|---|
| Exactly two (three sets) | Σn(A∩B) − 3·n(A∩B∩C) |
| At least two | Σn(A∩B) − 2·n(A∩B∩C) |
| Complement | n(A') = n(U) − n(A) |
| De Morgan’s laws | (A∪B)' = A'∩B' ; (A∩B)' = A'∪B' |