Union & Intersection
The union A∪B is everything that lies in A or B (or both); the intersection A∩B is only the common part. The whole subject rests on one counting idea: if you simply add n(A) and n(B), the overlap A∩B gets counted twice, so you must subtract it once. That is the inclusion–exclusion principle, n(A∪B) = n(A) + n(B) − n(A∩B). In CAT this is rarely asked directly — instead you are given three of these four quantities and must find the fourth, or you are told "how many take only Maths" which is n(A) − n(A∩B). The fast habit is to picture the two regions "only A", "only B", and "both", whose sizes always add to n(A∪B). Watch the wording: "either" usually means union, while "both" means intersection. When the universe and a "neither" count are given, remember Total = n(A∪B) + n(neither).
✅ 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' |