Venn Diagrams
Recognising This Question Type
Venn Diagram questions come in two very different flavours: work-based (calculate an overlap, total, or missing value) and luck-based (pick which of four visually similar diagrams is correct, or decide which qualitative statement about a diagram is true). They are MC (4 options, 1 mark).
These make up ~7-8 questions (~22.5% of DM - the largest single type by proportion). But the time varies dramatically: 45-60 seconds for work-based, skip or flag for luck-based.
Step Zero: Classify Before You Start
Spend 3 seconds classifying. This decision shapes everything:
| The question is asking… | Type | Action |
|---|---|---|
| Calculate a number (how many visited only X? what fraction sits in region Y?) | Work-based | Attempt it - 45-60 seconds |
| Choose which diagram matches the text (4 pre-drawn diagrams, pick correct one) | Luck-based | Flag for later. Guess if needed. Return only with banked time. |
| Decide which qualitative statement is true ("All X are Y", "Some Z are W") | Mixed | Check if you can eliminate fast - if not, flag |
Why skip luck-based? These questions require checking every region of every option diagram against every constraint. For 1 mark, this can take 2+ minutes. That time is better spent on 2-mark Syllogisms or II sets.
The Technique: Shape-to-Maths
Step 1: Identify the sets. What does each circle represent? How many sets? (2 or 3)
Step 2: Label the regions. Every Venn diagram has distinct regions. Name or number each one.
Step 3: Fill in known values. Start from the INSIDE OUT. Fill the overlap (intersection) first, then work outward to "only A", "only B", "neither."
Step 4: Use the total as a check. All regions must sum to the total. If they don't, you've got an error.
2-Set Venn Diagram
A 2-set diagram has 4 regions: a (only A), ab (the overlap), b (only B), and n (neither - the area outside both circles).
| Quantity | Formula |
|---|---|
| Total | a + ab + b + n |
| A total | a + ab |
| B total | b + ab |
| A or B (union) | a + ab + b |
| A and B (overlap) | ab |
| Only A | a = (A total) − ab |
The subtraction shortcut: If you know the total for A and the overlap (ab), then "Only A" = A total - ab. You almost never need formal equations for 2-set problems.
The overlap trap: The overlap region counts in BOTH circles. When a question says "15 people do A" and "12 people do B" and "5 do both," that 5 is already included in both the 15 and the 12. So "A or B" = 15 + 12 - 5 = 22, not 27. Forgetting this is the most common Venn diagram error.
3-Set Venn Diagram
A 3-set diagram has 8 regions:
| Region | Description |
|---|---|
a | Only A |
b | Only B |
c | Only C |
ab | A and B only (not C) |
ac | A and C only (not B) |
bc | B and C only (not A) |
abc | All three (the centre) |
n | Neither - outside all circles |
Total = a + b + c + ab + ac + bc + abc + n
The inside-out rule: Always fill the centre (abc) first, then the two-set overlaps (ab, ac, bc), then the "only" regions, then "neither." Working outward prevents double-counting.
Worked Example (2-Set)
Stimulus:
"32 guests stayed at an activity centre. 27 guests visited the mountaineering centre and/or the hill top observatory. The number who only visited the observatory is two-thirds the number who only visited the mountaineering centre."
Step 1: Identify sets. A = mountaineering. B = observatory. Total = 32.
Step 2: Fill known values.
- A or B (union) = 27
- Neither = 32 - 27 = 5
- Let "only A" = x. Then "only B" = (2/3)x.
- Union = (only A) + overlap + (only B) = x + overlap + (2/3)x = 27
Step 3: We need one more equation. The question offers 4 diagram options with specific numbers. Check which one satisfies ALL constraints.
| Check | Constraint 1: union = 27? | Constraint 2: only B = (2/3) x only A? |
|---|---|---|
| Option A: only A=10, overlap=5, only B=5 | 10+5+5=20. No. | 5 = (2/3)(10) = 6.67. No. |
| Option B: only A=10, overlap=12, only B=5 | 10+12+5=27. Yes. | 5 = (2/3)(10) = 6.67. No. |
| Option C: only A=9, overlap=12, only B=6 | 9+12+6=27. Yes. | 6 = (2/3)(9) = 6. Yes. |
| Option D: only A=9, overlap=5, only B=6 | 9+5+6=20. No. | 6 = (2/3)(9) = 6. Yes. |
Only Option C satisfies both constraints. Answer: C.
Time check: Two constraints eliminate 3 of 4 options. You don't need to check every region - just the distinguishing constraints. ~50 seconds.
Worked Example (3-Set)
Stimulus:
"60 students were surveyed about which sports they play. 30 play football, 25 play tennis, and 20 play basketball. 10 play both football and tennis, 8 play both football and basketball, 5 play both tennis and basketball, and 3 play all three sports."
Question: "How many students play none of these sports?"
Step 1: Identify sets. F = football, T = tennis, B = basketball. Total = 60.
Step 2: Fill inside-out.
- All three (abc) = 3
- F & T only = 10 - 3 = 7
- F & B only = 8 - 3 = 5
- T & B only = 5 - 3 = 2
- Only F = 30 - 7 - 5 - 3 = 15
- Only T = 25 - 7 - 2 - 3 = 13
- Only B = 20 - 5 - 2 - 3 = 10
Step 3: Sum all regions: 15 + 13 + 10 + 7 + 5 + 2 + 3 = 55.
Step 4: Neither = 60 - 55 = 5 students.
Time check: The inside-out method makes each subtraction straightforward. ~45 seconds.
The Flipping Method
When a problem gives you the number who don't have something, flip it:
"100 students don't play football. Total = 300."
Flip:300 − 100 = 200students do play football.
Now work with 200 (the positive value).
This avoids working with negations, which are error-prone.
The Units Digit Trick
For quick addition verification, only sum the units digits:
"Does `39 + 49 + 53 = 141`?"
Units:9 + 9 + 3 = 21→ units digit = 1
Answer ends in 1?141→ yes. Checks out.
"Does `39 + 49 + 53 = 143`?"
Units digit would need to be 3, but9+9+3 = 21→ units = 1. Mismatch - wrong answer.
Not a proof, but it catches arithmetic errors in seconds.
Handling "Which Statement Must Be True?" Questions
These give you a diagram with numbers and ask which of 4 statements is supported. For each statement:
| Question | Action |
|---|---|
| Can I verify this with simple arithmetic from the diagram regions? | Calculate and check. |
| Does this require knowing something the diagram doesn't specify? | Cannot be determined - eliminate. |
Usually 1-2 options can be eliminated immediately because they require information not shown.
Underlying Skills
Venn Diagram questions test five skills from the DM taxonomy:
- C1: Venn Region Identification - pure visual reading of which region corresponds to a set combination. No calculation needed.
- C2: Venn Numerical Calculation - arithmetic on region values (totals, fractions, comparisons).
- C3: Venn Construction from Text - translating verbal constraints into set regions and checking which diagram satisfies them all. This is the "luck-based" type.
- C4: Venn Algebraic Word Problem - using inclusion-exclusion to find unknown values with no diagram provided.
- C5: Venn Qualitative Relationship Reading - determining which qualitative statements about set relationships (containment, non-overlap) are true.
Work-based questions (C1, C2, C4) are worth your time. Luck-based questions (C3, C5) should be flagged unless you can eliminate options quickly.
Common Mistakes
- Double-counting overlaps - If 15 people do A and 12 people do B, and 5 do both, the total doing A or B is 15 + 12 - 5 = 22, not 27. The overlap is already counted in both group totals.
- Working outside-in instead of inside-out - For 3-set diagrams, always fill the centre first. Working from the outside creates cascading errors.
- Spending 2+ minutes on a luck-based question - If you're checking four diagrams region by region, you're spending too long for 1 mark. Flag and return.
- Forgetting "neither" - The region outside all circles exists. Total - union = neither. Many questions hinge on this value.
Summary
| Element | Detail |
|---|---|
| Technique | Shape-to-Maths: label regions, fill inside-out, use total as check |
| Time target | 45-60s work-based, flag luck-based |
| 2-set | 4 regions: only A, overlap, only B, neither |
| 3-set | 8 regions: fill centre first, work outward |
| Flipping | "100 don't have X" in total of 300 = "200 DO have X" |
| Units trick | Sum only units digits to verify arithmetic fast |
| Key trap | Double-counting the overlap - it's already inside both circle totals |
Next lesson: 2.6 Logical Puzzles