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.
Answer key: Sets, Venn diagrams and tree diagrams worksheet — GCSE Foundation
MathsUKwww.geekhero.co.uk
- (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.
- (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.
- (a) 12/25 — P(red then blue) = 4/10 × 6/10 = 24/100. P(blue then red) is the same, 6/10 × 4/10 = 24/100. Since either order counts as different colours, add them: 24/100 + 24/100 = 48/100 = 12/25. Working out only one order, red-then-blue, and forgetting blue-then-red, gives 24/100 = 6/25. Working out the probability that the two counters are the SAME colour instead — 4/10 × 4/10 + 6/10 × 6/10 = 16/100 + 36/100 = 52/100 = 13/25 — answers a different question. Using 6/9 for the second draw, as if the first counter were not replaced, gives 2 × (4/10 × 6/9) = 48/90 = 8/15.
- (b) 1/10 — Method: list every possible pair of subjects systematically, so that no pair is missed and no pair is counted twice, then compare the number of successful pairs with the size of the list. Working: pairing maths with each of the other four gives 4 pairs, physics with each subject after it gives 3, biology gives 2 and chemistry gives 1, so there are 4 + 3 + 2 + 1 = 10 pairs. Exactly one of them is maths with biology. Answer: the probability is 1/10. The distractors: 1/5 comes from counting maths-then-biology and biology-then-maths as two separate successes while still dividing by the 10 unordered pairs; 1/15 comes from a list that also pairs each subject with itself, giving 15 entries instead of 10; 1/4 comes from working out the second step alone, that 1 of the 4 subjects left after maths is biology, without allowing for the chance that maths is picked at all.
- (d) 4 — Method: list the elements of each set in full, then find which elements appear in both lists — that is A ∩ B. Working: factors of 12 = {1, 2, 3, 4, 6, 12}. Factors of 18 = {1, 2, 3, 6, 9, 18}. The elements in both lists are 1, 2, 3 and 6, so A ∩ B = {1, 2, 3, 6} and n(A ∩ B) = 4. Answer: 4. Watch out: writing down 6 gives n(A), the size of the factors-of-12 list on its own, not the size of the overlap. Writing down 8 comes from counting every element that appears in EITHER list, 1, 2, 3, 4, 6, 9, 12 and 18 — that is the union, a different set from the intersection. And writing down 3 misses that 1 is a factor of both 12 and 18, and so belongs in A ∩ B alongside 2, 3 and 6.
- (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.
- (c) 4/5 — Add the counts of everyone who owns a cat, a dog, or both: 12 + 15 + 5 = 32 out of 40 people, which simplifies to 4/5. Leaving out the 5 people who own both, and adding only the two only-groups, gives 27/40. Using the 8 people who own neither, instead of everyone who owns at least one pet, gives 8/40 = 1/5. Counting the 5 people who own both twice, once alongside each only-group as well as on their own, gives 12 + 15 + 5 + 5 = 37 out of 40, or 37/40.
- (a) 2/3 — Method: 'in A or in B' means every score that belongs to at least one of the two sets; a score that belongs to both is still only one outcome, so it is listed once. Working: the even scores are 2, 4 and 6; the scores greater than 4 are 5 and 6. Listing the scores that appear in either set gives 2, 4, 5 and 6, with 6 written once. That is 4 of the 6 faces, or 4/6. Answer: the probability is 2/3. The distractors: 5/6 comes from adding the sizes of the two sets, 3 + 2, so that the score 6 is counted in both and appears twice; 1/2 comes from using the even scores alone; 1/6 comes from giving the probability that the score is in both sets, which is the single score 6, rather than in either of them.
- (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) 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.
- (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.
- (d) 21 — Method: 'yoga only' means yoga but not pilates, so subtract the number who do both from the total who do yoga. Working: 32 − 11 = 21. Answer: 21. Watch out: writing down 32, the total who do yoga, answers 'how many do yoga' rather than 'how many do yoga only' — it still includes the 11 who also do pilates. Adding the overlap instead of subtracting it, 32 + 11 = 43, moves in the wrong direction entirely. And writing down 11 gives the number who do both activities, which is the opposite of yoga only.
- (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.
- (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.
- (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.
Build your own mix at the worksheet builder.