- Practice
- About 15 min
- 5 practice questions
Venn diagram problems: only, exactly and at least
Solve two- and three-set survey problems for only, exactly one, exactly two, none and the least possible overlap, using formulas and the fill-from-the-centre method.
If something looks wrong, please tell us.
Survey problems are the most common numerical questions on sets. The data are always the same kind, sizes of sets and of their overlaps, but the question can ask for many different regions: only A, exactly one, exactly two, at least one, none, or the least possible overlap. This lesson builds the formulas for each region and the two methods for using them: the formula route for one number and the fill-from-the-centre route for detailed questions.
Two sets: every region from four numbers
With n(U), n(A), n(B) and n(A ∩ B) known, every region follows. A only = n(A) − n(A ∩ B). B only = n(B) − n(A ∩ B). At least one = n(A ∪ B) = n(A) + n(B) − n(A ∩ B). Exactly one = n(A ∪ B) − n(A ∩ B). None = n(U) − n(A ∪ B). If everyone is in at least one set, n(A ∪ B) = n(U), and the overlap is simply n(A) + n(B) − n(U). Percentages work the same way with n(U) = 100.
Worked example 1: percentages
In a town, 65% of families read newspaper A, 40% read B and 20% read both. What percentage read neither? At least one = 65 + 40 − 20 = 85%, so neither = 100 − 85 = 15%. A only = 65 − 20 = 45% and B only = 40 − 20 = 20%, and 45 + 20 + 20 + 15 = 100 confirms the picture.
Least and greatest overlap
When the overlap is not given, it can only be bounded. The overlap cannot exceed the smaller set, so the greatest value of n(A ∩ B) is the smaller of n(A) and n(B). The union cannot exceed n(U), so n(A) + n(B) − n(A ∩ B) ≤ n(U), which gives the least value n(A ∩ B) ≥ n(A) + n(B) − n(U). If that number is zero or negative, the least overlap is 0. For example, in a group of 50 where 35 like tea and 30 like coffee, at least 35 + 30 − 50 = 15 and at most 30 like both.
Three sets: exactly one and exactly two
Let S1 = n(A) + n(B) + n(C), S2 = n(A ∩ B) + n(B ∩ C) + n(A ∩ C) and S3 = n(A ∩ B ∩ C). Then at least one = S1 − S2 + S3. A person in exactly two sets is counted once in S2, but a person in all three is counted three times in S2, so exactly two = S2 − 3 × S3. A similar count gives exactly one = S1 − 2 × S2 + 3 × S3. These give single answers fast; for several answers, fill the diagram from the centre instead.
Three sets: at least one = S1 − S2 + S3; exactly two = S2 − 3S3; exactly one = S1 − 2S2 + 3S3. Least overlap of two sets = n(A) + n(B) − n(U), not below 0.
Worked example 2: a full three-set survey
Of 200 people, 90 like A, 80 like B and 70 like C; 30 like A and B, 25 like B and C, 20 like A and C, and 10 like all three. Here S1 = 240, S2 = 75 and S3 = 10. At least one = 240 − 75 + 10 = 175, so none = 200 − 175 = 25. Exactly two = 75 − 30 = 45. Exactly one = 240 − 150 + 30 = 120. Check by filling from the centre: all three 10; A and B only 20, B and C only 15, A and C only 10 (sum 45); A only 90 − 20 − 10 − 10 = 50, B only 80 − 20 − 15 − 10 = 35, C only 70 − 15 − 10 − 10 = 35 (sum 120). Finally 120 + 45 + 10 = 175, as found.
Worked example 3: reading 'only' correctly
In a group of 60, 40 play chess, 26 play carrom and 8 play neither. How many play carrom only? At least one = 60 − 8 = 52. Both = 40 + 26 − 52 = 14. Carrom only = 26 − 14 = 12. The trap is to answer 26, which counts everyone who plays carrom, including those who also play chess. 'Only' always means subtracting the overlaps.
Key takeaways
Name the region the question asks about before calculating. For two sets, find the overlap first and everything else follows. For three sets, use S1, S2 and S3 for one quick answer, and fill from the centre when several regions are needed or when you want a check. The least overlap comes from the union not exceeding the total.
Check your understanding
-
1. In a survey, 70% like apples and 60% like mangoes, and everyone likes at least one. What percentage like both?
- 10%
- 40%
- 60%
- 30%
Show answer
Answer: D. At least one is 100%, so both = 70 + 60 − 100 = 30%.
-
2. In a group of 60, 40 play chess, 26 play carrom and 8 play neither. How many play carrom only?
- 26
- 12
- 14
- 18
Show answer
Answer: B. At least one = 60 − 8 = 52. Both = 40 + 26 − 52 = 14. Carrom only = 26 − 14 = 12.
-
3. The three pairwise intersections of A, B and C have 12, 10 and 8 elements, and A ∩ B ∩ C has 3. How many elements are in exactly two of the sets?
- 30
- 27
- 24
- 21
Show answer
Answer: D. Exactly two = S2 − 3 × S3 = (12 + 10 + 8) − 3 × 3 = 30 − 9 = 21.
-
4. Of 100 people, 72 speak Hindi and 43 speak English. What is the least possible number who speak both?
- 43
- 28
- 15
- 0
Show answer
Answer: C. The union cannot exceed 100, so both ≥ 72 + 43 − 100 = 15. This value is possible when everyone speaks at least one language.
-
5. Of 50 people, 20 like A, 25 like B and 15 like C; 8 like A and B, 6 like B and C, 5 like A and C, and 3 like all three. How many like none?
- 9
- 3
- 6
- 12
Show answer
Answer: C. At least one = 20 + 25 + 15 − 8 − 6 − 5 + 3 = 44, so none = 50 − 44 = 6.
Sign in to keep track of the lessons you finish.