Quick answer: For three finite sets, n(A ∪ B ∪ C) = n(A) + n(B) + n(C) − n(A ∩ B) − n(A ∩ C) − n(B ∩ C) + n(A ∩ B ∩ C). Pairwise intersections normally include the triple overlap.
Worked example
In a class of 40, three clubs have 20, 18 and 15 members. Pairwise overlaps are 8, 6 and 5; three students join all three. How many join at least one?
- Add individual counts: 20 + 18 + 15 = 53.
- Subtract pair overlaps: 53 − 8 − 6 − 5 = 34.
- Restore the triple overlap once: 34 + 3 = 37.
- Thus 40 − 37 = 3 join none.
Check the result
Exactly two clubs: (8 − 3) + (6 − 3) + (5 − 3) = 10. Exactly one: 37 − 10 − 3 = 24.
Stuck on a question? Ask it here and get a step-by-step answer in seconds — pay only per answer, no subscription. Ask your doubt now →
Common mistake to avoid
Do not subtract the triple overlap from a pair count unless calculating a pair-only region.
Try it yourself
1. In this example, how many are in A only? 2. How many are in at least two clubs?
Answers and reasoning
1. 20 − 8 − 6 + 3 = 9. 2. Exactly two plus all three = 10 + 3 = 13.
Need help with your own attempt? Ask a study question. AI answers require an account and paid credits. Check important steps with your textbook or teacher.
Stuck on a question? Ask it here and get a step-by-step answer in seconds — pay only per answer, no subscription. Ask your doubt now →
