Printable · GCSE Foundation · ages 14-16
Probability worksheet — GCSE Foundation
Fifteen questions across the probability statements at Foundation tier. Choose the non-calculator filter to rehearse Paper 1, which counts for a third of the marks.
Answer key: Probability worksheet — GCSE Foundation
MathsUKwww.geekhero.co.uk
- (a) Game B, by £8 — Game A's expected total is 40 × 0.2 × £5 = £40. Game B's expected total is 40 × 0.1 × £12 = £48. Game B is higher, by £48 − £40 = £8. Writing 'Game A, by £8' is wrong because it has the right difference but the wrong game — Game A's total (£40) is actually LOWER than Game B's, not higher. Writing 'Game B, by £48' is wrong because £48 is Game B's whole expected total, not the DIFFERENCE between the two games. Writing 'Game A, by £40' is wrong in the same way, using Game A's whole total as if it were the margin, and naming the wrong game as the winner. Game B gives the higher expected total, by £8.
- (b) 10 — There are 25 equally likely ordered pairs in total. Listing the pairs where the Spinner P score is less than the Spinner Q score gives 10 outcomes, running from (1, 2) up to (4, 5). Choosing 15 comes from also including the 5 pairs where the two scores are equal, such as (1, 1) and (2, 2), which do not satisfy 'less than'. Choosing 4 comes from counting only the outcomes where the scores differ by exactly 1, such as (1, 2) and (2, 3), and missing the pairs that differ by 2, 3 or 4. Choosing 20 comes from correctly excluding the 5 outcomes where the two scores are equal, 25 − 5 = 20, but forgetting to also exclude the outcomes where Spinner P is bigger than Spinner Q, rather than smaller.
- (c) 5/8 — Method: the sections are all the same size, so every section is equally likely; count the sections that are not red and write that count over the total number of sections. Working: 8 − 3 = 5 sections are not red, and there are 8 sections altogether. Answer: 5/8, a value between 0 and 1 and a little above the halfway point of the scale. The distractors: 3/8 comes from giving the probability that the spinner does land on red; 5/11 comes from adding the 3 red sections to the 8 sections to make a total of 11 instead of using the 8 sections that exist; 1/2 comes from assuming that 'red' and 'not red' must be equally likely because there are only two possibilities.
- (a) 4/7 — Method: going away and not going away are the only two possibilities, so the two probabilities form an exhaustive set and add to 1; subtract the given probability from 1. Working: writing 1 as 7/7 gives 7/7 − 3/7, and 7 − 3 = 4 sevenths. Answer: 4/7. The distractors: 3/7 comes from giving back the probability that the family do go away; 1/7 comes from taking the 1 in '1 − 3/7' as a numerator and writing it over the denominator 7; 1/2 comes from assuming that going away and not going away must be equally likely because there are only two possibilities.
- (b) 41/160 — In total, 27 + 14 = 41 of the 160 employees cycle to work, so the probability is 41/160 (41 and 160 share no common factor, so this is already in its simplest form). Writing 27/160 is wrong because it only counts the full-time cyclists and leaves out the 14 part-time cyclists. Writing 41/90 is wrong because it uses the full-time total (90) as the denominator instead of the whole survey (160). Writing 1/5 is wrong because it only uses the part-time branch, simplifying 14/70 to 1/5 and ignoring the full-time cyclists completely. The probability is 41/160.
- (b) £0.30 profit for the stall — The stall keeps the £1.50 entry fee whatever happens, and expects to pay out prize × probability of winning = £6 × 0.2 = £1.20 on average. So its expected profit per game is £1.50 − £1.20 = £0.30. Reporting the expected pay-out of £1.20 itself as the profit forgets that the stall also keeps the entry fee. Assuming the player always wins gives an expected cost of £6 − £1.50 = £4.50, treated as a loss for the stall. Using the probability of NOT winning, 0.8, to find the expected pay-out gives £6 × 0.8 = £4.80, and £1.50 − £4.80 = −£3.30, a £3.30 loss.
- (a) 1276 — Method: an unbiased relative frequency tends towards the theoretical probability as the number of trials increases, so use the record resting on the most trials, then multiply by the number of new trials. Working: the three records rest on 50, 200 and 1000 drops, so the most reliable is the one after 1000 drops, namely 0.638, and the run is indeed settling as the trials increase. The expected number of point up landings in 2000 further drops is 2000 × 0.638 = 1276. Answer: about 1276 times. The distractors: 1440 uses the earliest record, which rests on only 50 drops, giving 2000 × 0.720 = 1440; 1330 uses the middle record, treating 200 drops as a safe compromise when 1000 drops is better still, giving 2000 × 0.665 = 1330; 1348 comes from averaging the three records, since 0.720 + 0.665 + 0.638 = 2.023 and 2.023 ÷ 3 = 0.674, then 2000 × 0.674 = 1348, which gives the 50 drop record the same weight as the 1000 drop record.
- (b) 4 — With 150 rolls and probability 1/6 for each number, the expected count is 150 ÷ 6 = 25. Comparing each actual count with 25: 1 is 22 (3 below), 2 is 27 (2 above), 3 is 24 (1 below), 4 is 34 (9 above), 5 is 21 (4 below) and 6 is 22 (3 below). Number 4 is furthest above its expected count, so it is the most over-represented. Number 2 is also above its expected count, but by only 2, far less than 4's 9. Number 3's count of 24 is below the expected 25, so it is under-represented, not over. Number 6's count of 22 is also below the expected 25, so it too is under-represented.
- (a) 0.368 — Combining both samples, the spinner landed on red 34 + 58 = 92 times out of a total of 85 + 165 = 250 spins, so the best estimate of the probability is 92/250 = 0.368. Writing 0.400 is wrong because it uses only the first sample, 34/85 = 0.400, ignoring the extra 165 spins recorded afterwards. Writing 0.352 is wrong because it uses only the second sample, 58/165 = 0.352 (to 3 decimal places), ignoring the first 85 spins. Writing 0.376 is wrong because it averages the two separate estimates, (0.400 + 0.352) ÷ 2 = 0.376, instead of combining the actual numbers of reds and spins across both samples. The best estimate of the probability that the spinner lands on red, using all 250 spins, is 0.368.
- (b) 11/36 — Method: 'at least one' is the opposite of 'none at all', so work out the probability of no 5 on either roll and take it away from 1. Working: a roll that is not a 5 has probability 5/6, and the rolls are independent, so no 5 at all has probability 5/6 × 5/6 = 25/36. Taking this from 36/36 leaves 11/36. Answer: the probability is 11/36. The distractors: 25/36 is the probability of no 5 at all, written down without the final subtraction; 12/36 comes from counting the 6 pairs with a 5 on the first roll and the 6 pairs with a 5 on the second and adding them, which counts the pair (5, 5) twice; 30/36 comes from working out 1 − 1/6 as though only one roll were made.
- (a) 4/9 — There are 3 × 6 = 18 equally likely outcomes. The product is a multiple of 5 whenever Spinner C shows 5, whatever Spinner D shows, which is 6 outcomes, or whenever Spinner D shows 5 and Spinner C shows 2 or 3, which is 2 more outcomes. This gives 6 + 2 = 8 outcomes, so the probability is 8/18 = 4/9. Choosing 1/3 comes from only counting the 6 outcomes where Spinner C shows 5 and forgetting the 2 outcomes where Spinner D shows 5 instead. Choosing 1/9 comes from only counting the 2 outcomes where Spinner D shows 5 and forgetting the 6 outcomes where Spinner C shows 5. Choosing 1/2 comes from counting 9 outcomes instead of 8, by listing the case where Spinner C shows 5 and Spinner D shows 5 twice over.
- (a) 1/29 — The probability that Priya's ticket wins is 6/30. Since her ticket is not returned, there are now only 5 winning tickets left out of 29 tickets in total, so the probability that Tom's ticket also wins is 5/29. Multiplying these, 6/30 × 5/29 = 30/870 = 1/29. A candidate who answers 1/25 has treated Priya's ticket as returned, using 6/30 twice. A candidate who answers 1/30 has correctly reduced the winning tickets to 5 for Tom but forgotten to reduce the total number of tickets, using 5/30 instead of 5/29. A candidate who answers 11/59 has added the numerators and added the denominators, (6+5)/(30+29), instead of multiplying.
- (b) 24/125 — On the fiction branch, 160 − 112 = 48 books were returned late. None of the non-fiction books were late, so the total number of late books is 48, out of 250 books altogether: 48/250 = 24/125. Writing 3/10 is wrong because it divides the 48 late fiction books by the fiction total (160) instead of the whole library total (250). Writing 56/125 is wrong because 112/250 simplifies to 56/125, and 112 is the number of fiction books returned ON TIME, not late. Writing 9/25 is wrong because 90/250 simplifies to 9/25, and 90 is simply the number of non-fiction books, which has nothing to do with late returns. The probability is 24/125.
- (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) 102 — Method: turn the past record into a relative frequency, then use it as an estimate of the probability of rain and multiply by the number of days being predicted for. Working: relative frequency of rain = 70 ÷ 250 = 0.28. Expected rainy days in 365 days = 365 × 0.28 = 102.2, which rounds to about 102 days. Answer: about 102 days. Watch out: writing down 48 swaps which number is the sample and which is the target, working out 70 ÷ 365 × 250 instead of 70 ÷ 250 × 365. Writing down 70 just repeats the original count of rainy days without scaling it up to the new, longer period at all. And writing down 110 comes from rounding the relative frequency to 0.3 before multiplying, 365 × 0.3 = 109.5, when 70 ÷ 250 is exactly 0.28 and needs no rounding at all.
Build your own mix at the worksheet builder.