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
- (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.
- (c) Red — Theoretical probability is 1/3 ≈ 0.333 for each colour. Red's relative frequency is 38/90 ≈ 0.422, above 1/3, so red is over-represented. Blue's relative frequency is 26/90 ≈ 0.289, below 1/3, so blue is under-represented, not over. Green's relative frequency is also 26/90 ≈ 0.289, below 1/3 for the same reason. Since red's relative frequency clearly exceeds 1/3, it is not true that none of the colours are over-represented.
- (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) 0.49 — The two rounds are independent, so multiply the probability of losing each round: 0.7 × 0.7 = 0.49. Choosing 0.7 comes from giving the probability of losing just one round, forgetting there are two rounds to combine. Choosing 1.4 comes from adding the two probabilities instead of multiplying, 0.7 + 0.7 = 1.4. Choosing 0.09 comes from using the probability of WINNING instead of losing, 0.3 × 0.3 = 0.09.
- (c) 0.65 — Overrunning and not overrunning are exhaustive: between them they cover every outcome, so their probabilities sum to 1. Work out 1 − 0.35 = 0.65. Writing 0.35 again is the probability that the appointment overruns, not its complement — the subtraction was never done. Adding instead of subtracting gives 1 + 0.35 = 1.35, which cannot be a probability at all. Subtracting each digit from 10 instead of borrowing from the 1, so 10 − 3 = 7 tenths and 10 − 5 = 5 hundredths, gives 0.75.
- (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.
- (a) 1/16 — The two spins are independent, so multiply the probability of blue on each spin: 1/4 × 1/4 = 1/16. Choosing 1/2 comes from adding the two probabilities instead of multiplying, 1/4 + 1/4 = 1/2. Choosing 1/8 comes from wrongly treating the second spin as having a 1/2 chance of blue instead of the given 1/4, giving 1/4 × 1/2 = 1/8. Choosing 1/4 comes from giving the probability for a single spin and forgetting that the spinner is spun twice.
- (d) 24 — There are 4 choices for the first digit. Once that digit is used, 3 digits remain for the second position, and then 2 digits remain for the third position: 4 × 3 × 2 = 24 codes. Choosing 64 comes from allowing a digit to be reused at every position, 4 × 4 × 4 = 64, which is not allowed here since no digit repeats. Choosing 12 comes from multiplying only the first two positions, 4 × 3 = 12, and forgetting that a third digit is also chosen from the digits that remain. Choosing 6 comes from counting only the arrangements of one single set of three digits, 3 × 2 × 1 = 6, and forgetting that there are 4 different sets of three digits that can be chosen from 2, 3, 4 and 5.
- (a) £150 — Each game, the expected payout is 0.1 × £20 = £2, so the fête's expected profit per game is the £3 charged minus the £2 expected payout, £1. Over 150 games, that is 150 × £1 = £150. Writing £300 is wrong because 150 × £2 = £300 is the total expected PAYOUT, not the profit — it has not been subtracted from the entry fees. Writing £450 is wrong because 150 × £3 = £450 is the total money taken in entry fees, without accounting for what is expected to be paid out in prizes. Writing £1 is wrong because that is only the expected profit for ONE game — it has not been scaled up to all 150 games. The fête's expected profit is £150.
- (a) 1200 — Method: take the estimate from the larger sample, because an unbiased relative frequency tends towards the true probability as the sample grows, then multiply by the number of bulbs made in a week. Working: Inspector B tested 500 bulbs, far more than Inspector A's 40, so use B's relative frequency: 30 ÷ 500 = 0.06. A week's production is 4000 × 5 = 20000 bulbs. The expected number of faulty bulbs is 20000 × 0.06 = 1200. Answer: about 1200 faulty bulbs a week. The distractors: 2000 uses Inspector A's estimate, 4 ÷ 40 = 0.1, giving 20000 × 0.1 = 2000, and so rests on a sample of only 40 bulbs; 1600 comes from averaging the two estimates of 0.1 and 0.06 to get 0.08, and 20000 × 0.08 = 1600, which gives the small sample equal weight with the large one; 240 uses the right estimate but stops at a single day, 4000 × 0.06 = 240.
- (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.15 — Method: success and failure are the only two outcomes of the task, so they form an exhaustive set and their probabilities add to 1; subtract the given probability from 1. Working: writing 1 as 1.00 so that both numbers have two decimal places gives 1.00 − 0.85; exchanging once, the hundredths give 10 − 5 = 5 and the tenths, now 9, give 9 − 8 = 1. Answer: 0.15, close to the left-hand end of the 0 to 1 scale because the machine nearly always succeeds. The distractors: 0.85 comes from giving back the probability of success instead of the probability of failure; 0.25 comes from taking each decimal column from 10 on its own in 1.00 − 0.85, writing 10 − 5 = 5 in the hundredths and 10 − 8 = 2 in the tenths instead of reducing the tenths to 9 after the exchange; 0.5 comes from assuming that success and failure must be equally likely because there are only two outcomes.
- (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) She is wrong; 12 rolls is too few to judge — Method: compare the result with what is expected, then ask whether the experiment is long enough for a difference to mean anything. Working: if the dice were fair the expected number of sixes in 12 rolls is 12 × 1 ÷ 6 = 2, so 4 sixes is 2 above what was expected. But over only 12 rolls a result like this turns up often by chance: the relative frequency here is 4/12, which is 1/3, and over so few trials a relative frequency can sit well away from 1/6 with no bias at all. Answer: Erin is wrong, because 12 rolls is far too few to decide; she should roll the dice many more times and see whether the relative frequency settles near 1/6. The distractors: saying she is right because 4 beats the expected 2 uses the correct expected value but treats any difference as proof, which so short an experiment cannot give; saying a fair dice gives each score twice in 12 rolls treats an expected value as a guaranteed one; saying that 4 sixes in 12 rolls cancels down to 1 in 6 mis-cancels the fraction, because 4/12 is 1/3, which is twice 1/6, so that comment reaches the right verdict from arithmetic that is wrong.
- (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.
Build your own mix at the worksheet builder.