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

(b) 3 — Method: build the list of possible results systematically, taking the first flip as a head and then as a tail, and keeping the two flips in order so that a head then a tail is a different result from a tail then a head; then count the results that match the description. Working: with a head at the first flip the results are HH and HT, and with a tail at the first flip they are TH and TT, so the list is HH, HT, TH, TT — four results in all. The results containing at least one tail are HT, TH and TT. Answer: 3 of the results in the list contain at least one tail. The distractors: 2 comes from treating a head and a tail as one result however they are ordered, which shortens the list to HH, HT, TT so that only two entries hold a tail; 1 comes from reading 'at least one tail' as a tail at both flips, which is the single result TT; 4 comes from counting the tails written across the list — one in HT, one in TH and two in TT — instead of counting the results that contain a tail.
(c) 6 — Method: to list every combination of one item from a group of 3 and one item from a group of 2 systematically, multiply the two numbers of choices together. Working: 3 × 2 = 6. Answer: 6. Watch out: adding the two totals instead of multiplying, 3 + 2 = 5, misses combinations that a full grid would show — a grid with 3 rows and 2 columns has 6 cells, not 5. Writing down 3 counts only the pens, and writing down 2 counts only the types of paper — neither one pairs every pen with every type of paper.
(d) 32 — The frequency tree already shows the tea-and-coffee branch directly: of the 50 tea drinkers, 32 also drink coffee, so n(T ∩ C) = 32. Adding both coffee branches together, 32 + 6 = 38, gives n(C), the total number of coffee drinkers, not just those who also drink tea. Using the non-tea branch's figure, 6, describes people who drink coffee but NOT tea. Subtracting to get 50 − 32 = 18 finds the tea drinkers who do NOT drink coffee, the opposite region to the one asked for.
(b) 26 — Method: n(G ∪ H) = n(G) + n(H) − n(G ∩ H), taking off the overlap once so the pupils who study both subjects are not counted twice. Working: 19 + 15 − 8 = 26. Answer: 26. Watch out: adding 19 and 15 without taking off the overlap gives 34, which counts the 8 pupils who study both subjects twice. Taking the 8 off both totals before adding, 19 − 8 + 15 − 8 = 18, counts only the pupils who study exactly one of the two subjects and leaves out the 8 who study both. And writing down 11, which is 19 − 8, gives the number who study geography only, not the number who study geography or history or both.
(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) 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.
(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.
(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) 12 — Method: each result of the first experiment can be paired with every result of the second, so the two counts are combined by multiplying. Working: the coin lands in 2 ways and the dice lands in 6 ways. Each of the 6 dice scores can appear with a head or with a tail, so the table has 6 × 2 rows. Answer: there are 12 different results. The distractors: 8 comes from adding the two counts, 6 + 2, instead of multiplying them; 6 comes from listing the dice scores only and treating the coin as making no difference to the table; 36 comes from working out 6 × 6, counting the coin as though it too had six equally likely results.
(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.
(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) 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.
(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.
(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.

Build your own mix at the worksheet builder.