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.
Sets, Venn diagrams and tree diagrams worksheet — GCSE Foundation
MathsUKwww.geekhero.co.uk
- 1.A survey of 60 readers records: 21 read only fiction, 17 read only non-fiction, 14 read both, and the rest read neither. Work out the probability that a randomly chosen reader reads exactly one of the two types, giving your answer as a fraction in its simplest form.
- 2.The numbers 1 to 10 are each written on a card. Set A is the set of multiples of 3 from 1 to 10 and set B is the set of even numbers from 1 to 10. Work out how many of the numbers from 1 to 10 are in set A but not in set B.
- 3.Two sets, A and B, sit inside a universal set. A region of a Venn diagram is described by the notation A ∩ B′. Work out which of these describes that region.
- 4.80 people are asked whether they drink tea and whether they drink coffee, and the results are recorded on a frequency tree. The first pair of branches splits the 80 people into 50 tea drinkers and 30 non-tea-drinkers. Of the 50 tea drinkers, 32 also drink coffee. Of the 30 non-tea-drinkers, 6 drink coffee. Work out n(T ∩ C), the number of people who drink both tea and coffee.
- 5.The universal set is {1, 2, 3, ..., 30}. Set A is the set of multiples of 4 between 1 and 30. Work out n(A′), the number of elements not in A.
- 6.A fair coin is flipped and an ordinary fair dice is rolled. Every possible result is listed in a table. Work out how many different results the table contains altogether.
- 7.A bag contains one red counter and one blue counter. Josh takes a counter, notes its colour, puts it back, then takes a counter again. He draws a tree diagram to show every possible pair of colours. Work out how many outcomes are on his tree diagram.
- 8.150 pupils are asked about swimming and cycling, and the results are recorded on a frequency tree. The first pair of branches splits the 150 pupils into 90 who swim and 60 who do not swim. Of the 90 who swim, 54 also cycle. Of the 60 who do not swim, 18 cycle. Work out P(S ∩ C), the probability that a pupil, chosen at random, swims and cycles. Give your answer as a fraction in its simplest form.
- 9.A bag contains 5 red counters and 3 blue counters. A counter is taken at random, its colour is noted, and it is put back in the bag before a second counter is taken at random. Work out the probability that both counters are the same colour.
- 10.A school surveys 60 pupils. 32 say they walk to school, 24 say they cycle to school, and 12 say they do both, on different days. The rest travel only by car. One of the 60 pupils is chosen at random. Work out the probability that this pupil travels only by car.
- 11.A game has two independent stages. P(win stage 1) = 0.4, and P(win stage 2) = 0.25. Work out the probability that Ffion wins at least one of the two stages.
- 12.A Venn diagram shows two sets, P and Q, inside a universal set. n(P) = 34, n(Q) = 27, n(P ∩ Q) = 11, and n(ξ) = 90, where ξ is the universal set. Work out n((P ∪ Q)′), the number of elements in neither P nor Q.
- 13.Two fair spinners are each numbered 1, 2 and 3. Priya spins both spinners together and records the two numbers as a pair, listing every possible outcome systematically in a grid. Work out the probability that the two numbers are the same.
- 14.Leo flips a fair coin twice. He makes a list of every possible result of the two flips, writing down what the first flip lands on and then what the second flip lands on. Work out how many of the results in his list contain at least one tail.
- 15.The universal set is {1, 2, 3, ..., 15}. A = {multiples of 3}. Work out n(A′), the number of elements not in A.
Answer key
- (d) 19/30 — Exactly one means only fiction or only non-fiction, not both: 21 + 17 = 38 out of the 60 readers, which simplifies to 19/30. Including the 14 who read both as well gives 21 + 17 + 14 = 52, so 52/60 = 13/15 — that is at least one, not exactly one. Using only the both-count, 14, as the numerator gives 14/60 = 7/30, the probability of reading both, not exactly one. Using 52, the number who read at least one type, as the denominator instead of the full 60 readers surveyed gives 38/52 = 19/26.
- (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.
- (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.
- (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.
- (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.
- (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.
- (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) 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.
- (a) 17/32 — Because the counter is replaced, each pick is independent with P(red) = 5/8 and P(blue) = 3/8 every time. Both red has probability 5/8 × 5/8 = 25/64, and both blue has probability 3/8 × 3/8 = 9/64. 'Same colour' means either of these, so add them: 25/64 + 9/64 = 34/64 = 17/32. Giving 25/64 finds only the probability of both counters being red, leaving out both counters being blue, which also counts as the same colour. Giving 15/64 finds the probability of one red and one blue counter in just one of the two possible orders — the opposite of what was asked, and only half of it. Giving 13/28 works out the probabilities as if the counter had NOT been replaced, using 5/8 × 4/7 and 3/8 × 2/7, even though the question states it was put back.
- (a) 4/15 — Method: first find how many pupils travel only by car, then write that as a fraction of the 60 pupils surveyed. Working: pupils who walk or cycle or both = 32 + 24 − 12 = 44. Only by car = 60 − 44 = 16. P(only by car) = 16/60 = 4/15. Answer: 4/15. Watch out: writing down 1/5 takes the overlap of 12 pupils on its own, 12/60, mistaking the group who do both for the group who travel only by car. Writing down 4/5 comes from 60 − 12 = 48, subtracting only the overlap from the total instead of the whole walk-or-cycle count, so cyclists and walkers who are not in the overlap are wrongly swept into the only-car group. And writing down 7/15 comes from 60 − 32 = 28, subtracting the walkers alone and forgetting the cyclists altogether.
- (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.
- (d) 1/3 — List the outcomes for the two spinners systematically in a 3 × 3 grid: 1-1, 1-2, 1-3, 2-1, 2-2, 2-3, 3-1, 3-2, 3-3, where the first number is the score on spinner A and the second is the score on spinner B — 9 equally likely outcomes in total. The pairs where the two numbers are the same are 1-1, 2-2 and 3-3, so there are 3 favourable outcomes. P(same number) = 3/9 = 1/3. 2/3 comes from working out the probability that the two numbers are different and then forgetting to take the complement the right way round, so the probability of "different" is given instead of the probability of "same". 1/2 comes from listing only the 6 unordered pairs 1-1, 2-2, 3-3, 1-2, 1-3, 2-3 instead of all 9 ordered outcomes in the grid, then taking 3 out of that 6. 1/9 comes from spotting only one of the three matching pairs, such as 1-1, and missing 2-2 and 3-3.
- (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.
- (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.
Build your own mix at the worksheet builder.