Printable · GCSE Foundation · ages 14-16

Sets, Venn diagrams and tree diagrams worksheet — GCSE Foundation

Fifteen questions on "sets, venn diagrams and tree diagrams" — DfE statement P6. Print it, or print three versions so neighbours cannot copy by letter; the key gives the letter for each version.

VersionsA only A + B A + B + Csame questions, different order

AnswersQuestions only With answer key Key only

CalculatorMixed Non-calculator (Paper 1)Calculator (Papers 2 and 3)

New sheet

Answer key: Sets, Venn diagrams and tree diagrams worksheet — GCSE Foundation

Maths · GCSE Foundation · P6 · Sets, Venn diagrams and tree diagrams · 15 questions

MathsUKwww.geekhero.co.uk

(c) 9/25 — The frequency tree already shows the swim-and-cycle branch directly: 54 out of 150, which simplifies to 9/25. Adding both cycling branches together, 54 + 18 = 72, gives the total number of cyclists, so 72/150 = 12/25, not just those who also swim. Using the non-swimmers' cycling figure, 18, gives 18/150 = 3/25, the probability of cycling WITHOUT swimming. Using the swimmers' total of 90, before splitting by cycling, gives 90/150 = 3/5, the probability of swimming on its own.
(c) 26 — The number who play football or basketball is 27 + 21 − 9 = 39, subtracting the 9 who play both so they are not counted twice. The number who play neither is then 65 − 39 = 26. Giving 39 stops after finding the number who play football or basketball, without taking the complement within the 65 members. Subtracting all three given numbers from 65, 65 − 27 − 21 − 9 = 8, treats the 9 who play both as a separate group rather than a correction for double-counting. Adding 27 and 21 without removing the double-counted 9, then subtracting that total from 65, gives 65 − (27 + 21) = 17.
(c) 0.15 — Method: for two independent events, multiply along the branches of the tree to find the probability of both outcomes happening together. Working: P(red and heads) = P(red) × P(heads) = 0.3 × 0.5 = 0.15. Answer: 0.15. Watch out: adding the two probabilities, 0.3 + 0.5 = 0.8, does not give the probability of both — probabilities along one path of a tree are multiplied, not added. Writing down 0.5 ignores the spinner altogether and gives only the coin's probability. And writing down 0.65 is the probability of red OR heads, which is 0.3 + 0.5 − 0.15 = 0.65, a different question from the one asked here.
(c) The elements that are in A but not in B — The symbol ∩ means 'and', so A ∩ B′ means 'in A and also in the complement of B'. B′ means 'not in B'. So A ∩ B′ describes everything that is in A but not in B. The elements in both A and B describes A ∩ B, without the dash on B. The elements in B but not in A describes B ∩ A′, with the dash on A instead of B. The elements in neither A nor B describes (A ∪ B)′, the region outside both circles entirely.
(b) 40 — n(P ∪ Q) = n(P) + n(Q) − n(P ∩ Q) = 34 + 27 − 11 = 50. The complement is everyone outside both sets: n((P ∪ Q)′) = 90 − 50 = 40. Adding P and Q without subtracting the overlap gives 34 + 27 = 61, so 90 − 61 = 29 double-subtracts the 11 who are in both. Reporting n(P ∪ Q) itself, 50, forgets to take the complement at all. Subtracting only n(P) from the universal set, 90 − 34 = 56, ignores set Q altogether.
(c) 28 — Reading only is 22 − 6 = 16, and gaming only is 18 − 6 = 12, so exactly one of the two is 16 + 12 = 28. Adding 22 and 18 without removing the 6 who like both, 22 + 18 = 40, counts those 6 students twice. Giving 6 mistakes the number who like both for the number who like exactly one. Finding 22 + 18 − 6 = 34 gives the number who like at least one of reading or gaming, but stops there instead of also removing the 6 who like both to leave only those who like exactly one.
(b) 10 — The number who use the pool or the sauna (or both) is the total minus those who use neither: 70 − 12 = 58. Since pool + sauna double-counts the overlap, n(P ∩ S) = 38 + 30 − 58 = 10. Adding the pool and sauna counts without subtracting the overlap at all gives 38 + 30 = 68, more members than are in the whole gym. Subtracting the sauna count from the union, 58 − 30 = 28, actually finds the number who use ONLY the pool, not both. Reporting the 'neither' count, 12, confuses it with the 'both' region — they describe opposite corners of the diagram.
(c) 23 — Multiples of 4 from 1 to 30 are 4, 8, 12, 16, 20, 24 and 28 — 7 numbers, so n(A) = 7. The universal set has 30 elements, so n(A′) = 30 − 7 = 23. Reporting n(A) itself, 7, without subtracting it from the universal set forgets what the complement means. Estimating the count of multiples of 4 as 30 ÷ 4 = 7.5, rounded to 8, instead of listing them exactly, gives 30 − 8 = 22. Miscounting the universal set as having 31 elements instead of 30, an off-by-one slip, gives 31 − 7 = 24.
(b) 3/10 — The number who use at least one app is 90 − 20 = 70. Since 55 + 42 double-counts the overlap, n(X ∩ Y) = 55 + 42 − 70 = 27, so P(both) = 27/90 = 3/10. Forgetting to subtract the 20 who use neither, and using the full 90 as the union, gives 55 + 42 − 90 = 7, so 7/90. Reporting the probability of using X or Y (or both), 70/90 = 7/9, answers a different question about the union, not the overlap. Reporting the probability of using neither app, 20/90 = 2/9, is the complement of the union, not the intersection.
(d) 1/5 — Method: list the pairs systematically, work out each total, then count the pairs that meet the condition and compare that count with the length of the list. Working: the pairs and their totals are 1 and 2 giving 3, 1 and 3 giving 4, 1 and 4 giving 5, 1 and 5 giving 6, 2 and 3 giving 5, 2 and 4 giving 6, 2 and 5 giving 7, 3 and 4 giving 7, 3 and 5 giving 8, and 4 and 5 giving 9. That is 10 pairs, of which 2 have a total of more than 7. Answer: the probability is 1/5. The distractors: 2/5 comes from counting the totals of exactly 7 as well, reading 'more than 7' as '7 or more'; 1/10 comes from finding only the pair 4 and 5 and missing that 3 and 5 also beat 7; 4/5 comes from counting the pairs on the wrong side of the condition, the 8 pairs whose total is 7 or less.
(c) 2 — Set A, the multiples of 3, is {3, 6, 9}. Removing the numbers that are also in set B, the even numbers {2, 4, 6, 8, 10}, leaves {3, 9} — 2 numbers are in A but not B. Giving 3, the whole size of set A, forgets to remove the number 6, which is also even. Giving 7 counts every number in A or B combined, {2, 3, 4, 6, 8, 9, 10}, rather than only those in A but not B. Giving 4 counts the numbers in set B but not set A, {2, 4, 8, 10}, the wrong way round.
(b) 10 — Method: A′ means everything in the universal set that is NOT in A, so n(A′) = n(universal set) − n(A). Working: the universal set has 15 elements. A = {3, 6, 9, 12, 15}, so n(A) = 5. n(A′) = 15 − 5 = 10. Answer: 10. Watch out: writing down 5 gives n(A) itself, the size of the multiples-of-3 set, which is the opposite of its complement. Writing down 11 comes from missing 15 off the list of multiples of 3, treating A as only {3, 6, 9, 12}, so A is undercounted as 4 and A′ is overstated as 15 − 4. And writing down 12 comes from only listing the multiples of 3 up to 9 — 3, 6 and 9 — and missing that 12 and 15 also belong to A, undercounting A as 3 rather than 5.
(b) 10 — Method: the number using at least one machine is the running total plus the weights total minus the overlap, since the overlap would otherwise be added in twice; the number using neither is the survey total minus that. Working: at least one machine = 24 + 20 − 9 = 35. Neither = 45 − 35 = 10. Answer: 10. Watch out: subtracting 24 + 20 from 45 without adding the 9 back, 45 − 24 − 20 = 1, removes the overlap twice over instead of once. Writing down 15, which is 24 − 9, gives the number who use ONLY the running machines, not the number who use neither. And writing down 9 mistakes the overlap region for the region outside both circles altogether.
(d) 4 — Method: each of the first draw's 2 outcomes can be paired with each of the second draw's 2 outcomes, since the counter is put back before the second draw, so the tree has one branch for every combination. Working: 2 × 2 = 4 outcomes: red-red, red-blue, blue-red, blue-blue. Answer: 4. Watch out: writing down 2 lists only the colours of a single draw and never branches out to a second draw at all. Writing down 3 treats red-then-blue and blue-then-red as the same branch, when the tree diagram shows them as two separate paths, since the counter is put back and either colour could come first or second. And writing down 16 comes from working out 2 × 2 × 2 × 2, as though the counter were drawn four times instead of twice.
(b) 0.55 — Method: it is easier to find the probability that Ffion wins NEITHER stage, then subtract that from 1. Working: P(lose stage 1) = 1 − 0.4 = 0.6, and P(lose stage 2) = 1 − 0.25 = 0.75. P(neither) = 0.6 × 0.75 = 0.45. P(at least one) = 1 − 0.45 = 0.55. Answer: 0.55. Watch out: adding the two win probabilities, 0.4 + 0.25 = 0.65, treats winning both as impossible and overcounts — that is not how independent probabilities combine. Multiplying the two win probabilities, 0.4 × 0.25 = 0.1, gives the probability of winning BOTH stages, not at least one. And stopping at 0.45, the probability of winning neither stage, forgets the final step of subtracting from 1.

Build your own mix at the worksheet builder.