🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (c) 5/18 — Method: knowing the total is even cuts the 36 equally likely outcomes down to the even ones, so count those first and then count how many of them give 8. Working: the even totals occur as 2 once, 4 three times, 6 five times, 8 five times, 10 three times and 12 once, which is 18 outcomes. The total is 8 for 2 and 6, 3 and 5, 4 and 4, 5 and 3, and 6 and 2, which is 5 outcomes. The probability is 5/18, which will not cancel. Answer: the probability is 5/18. The distractors: 5/36 keeps the right count of ways to make 8 but divides by all 36 outcomes, ignoring the fact that the odd totals have already been ruled out; 1/6 treats the six even totals 2, 4, 6, 8, 10 and 12 as equally likely and picks one of them, which they are not; 1/11 treats the eleven possible totals from 2 to 12 as equally likely and uses neither the counting nor the condition.
2. (b) 0.458 — x₁ = (0.4² + 3) ÷ 7 = 3.16 ÷ 7 = 0.4514 (unrounded, 0.451428...). x₂ = (x₁² + 3) ÷ 7 = (0.2038 + 3) ÷ 7 = 3.2038 ÷ 7 = 0.458 (3 d.p.). Choosing 0.632 divides only the 3 by 7 instead of dividing the whole sum x₁² + 3 by 7. Choosing 0.451 repeats the calculation for x₁ instead of moving on to x₂. Choosing 0.493 uses x₁ itself instead of x₁² inside the formula.
3. (b) 5.00 — Continuing the iteration: x₁ = √(2 × 1 + 15) = √17 = 4.1231, x₂ = √(2 × 4.1231 + 15) = √23.2462 = 4.8214, x₃ = √(2 × 4.8214 + 15) = √24.6428 = 4.9642, x₄ = √(2 × 4.9642 + 15) = √24.9284 = 4.9928, and the values keep climbing towards 5.00 as n increases (the limit L satisfies L² = 2L + 15, so L² − 2L − 15 = 0, giving L = 5). Choosing 4.99 stops after x₄, one iteration before the value has settled fully to 5.00. Choosing 17.00 uses the value under the very first square root (2 × 1 + 15 = 17) as if that number itself were the limit. Choosing 1.00 assumes the sequence never moves from the starting value x₀.
4. (b) 0.0309 — Method: P(both defective | at least one defective) = P(both defective) ÷ P(at least one defective). Find each using independence: P(both) = 0.06², P(at least one) = 1 − P(neither) = 1 − 0.94². Working: P(both) = 0.06² = 0.0036. P(neither) = 0.94² = 0.8836, so P(at least one) = 1 − 0.8836 = 0.1164. P(both | at least one) = 0.0036 ÷ 0.1164 = 0.0309 (3 s.f.). Answer: 0.0309. Watch out: leaving the answer as 0.0036 gives P(both defective) itself, not the probability once you already know at least one is defective — you still need to divide by P(at least one defective). Giving 0.0600 answers with the single-component defect rate, ignoring the condition altogether. And 0.5000 assumes that 'at least one' makes the outcomes 'exactly one defective' and 'both defective' equally likely, which is not how these probabilities combine.
5. (a) y = 2ˣ + 3 — A translation of 3 units in the positive y-direction shifts the whole graph up, which means adding to the output: y = f(x) + k with k = 3, so the image is y = 2ˣ + 3. Adding the 3 inside the power instead of outside it, which translates the graph horizontally instead of vertically, gives y = 2ˣ⁺³. Using a negative 3, which moves the graph down instead of up, gives y = 2ˣ − 3. Mistaking 2ˣ for the linear expression 2x and adding 3 inside brackets gives y = 2(x + 3).
6. (c) 3/20 — Method: the second fraction is quoted for the perennials only, so it is a conditional probability and the two fractions multiply. Working: the probability that a plant is a perennial is 3/5, and given that it is a perennial the probability that it is in flower is 1/4. Multiplying gives 3 × 1 over 5 × 4, which is 3/20. Answer: the probability is 3/20. The distractors: 17/20 comes from adding the fractions, 12/20 plus 5/20, instead of multiplying, which would be right only for two outcomes that cannot both happen; 4/9 comes from adding the numerators and the denominators separately, the classic 3 + 1 over 5 + 4; 1/4 quotes the flowering fraction on its own, as though every plant in the garden centre were a perennial, so the 3/5 is never used.
7. (b) 12/19 — Method: turn the percentages into expected frequencies out of 1000, total the faulty pens, then divide supplier Y's faulty pens by that total, because the pen picked is known to be faulty. Working: supplier X provided 700 pens and 2% of them are faulty, which is 14 pens. Supplier Y provided 300 pens and 8% of them are faulty, which is 24 pens. Altogether 38 pens are faulty, so the probability is 24/38, and dividing the numerator and the denominator by 2 gives 12/19. Answer: the probability is 12/19. The distractors: 3/10 is supplier Y's share of the stock, the answer before the faulty information is used at all; 3/125 is 24/1000, the probability that a pen is from supplier Y and faulty, which stops at the joint probability and never divides by the probability of a fault; 4/5 is 8 divided by 2 + 8, comparing the two fault rates as though the suppliers provided equal numbers of pens, so the 70 to 30 split is thrown away.
8. (c) y = 3x + 2 — Method: divide the change in the outputs by the change in the inputs to find the multiplier, then put one pair of values into the rule to find the number added on. Working: the output rises by 11 − 5 = 6 while the input rises by 3 − 1 = 2, so the multiplier is 6 ÷ 2 = 3; with an input of 1, 3 × 1 = 3 and the output is 5, so 2 is added. Answer: y = 3x + 2, checked against the second pair by 3 × 3 + 2 = 11. The distractors: y = 3x − 2 comes from finding the multiplier 3 and then subtracting the 2 instead of adding it; y = 2x + 3 comes from swapping the multiplier and the number added on; y = x + 4 comes from assuming the input is multiplied by 1 and using 5 − 1 = 4 as the number added on.
9. (c) y = x² — Method: test a candidate rule against every pair given, not just one — a rule that fits one pair and fails another is not the rule. Working: the outputs 1, 4, 9 rise by 3 and then by 5, so they are not going up in equal steps and the input is not simply multiplied by a fixed number; comparing each output with its own input gives 1 × 1 = 1, 2 × 2 = 4 and 3 × 3 = 9, and all three pairs fit. Answer: y = x². The distractors: y = 3x comes from fitting only the last pair, where 3 × 3 = 9, and reading that 3 as a multiplier; y = 3x − 2 comes from assuming a multiply-then-add rule and using the first step in the outputs, 4 − 1 = 3, as the multiplier — it fits the first two pairs and fails the third; y = 2x comes from fitting only the pair 2 and 4 and reading every output as double its input.
10. (d) x² − 7x − 3 = 0 — Method: an iteration settles where the next value equals the one before it, so both can be written as the same letter x; replace every xₙ by x, square both sides to clear the square root, and collect all the terms on one side. Working: x = √(7x + 3) gives x² = 7x + 3 on squaring both sides; subtracting 7x and 3 from both sides gives x² − 7x − 3 = 0. Answer: x² − 7x − 3 = 0. The distractors: x² + 7x − 3 = 0 moves the 7x across the equals sign without changing its sign; x² − 7x + 3 = 0 makes that same slip on the constant instead, leaving the 3 positive as it crosses; x² − 7x − 9 = 0 squares the expression term by term, squaring the 3 to give 9 as though squaring √(7x + 3) gave 7x + 9, which is the (a + b)² = a² + b² mistake dressed as a square root.
11. (c) The class with times from 10 up to 20 — Method: to find the median class from a histogram, first turn each bar's frequency density into a frequency using density × class width, build up the cumulative frequency, and find the first class whose cumulative frequency reaches or passes n ÷ 2. Working: the four classes have widths 10, 10, 20 and 20, so their frequencies are 5 × 10 = 50, 2 × 10 = 20, 1.5 × 20 = 30 and 1 × 20 = 20, which add to the 120 visitors stated. The median sits at position 120 ÷ 2 = 60. The cumulative frequency is 50 after the first class and 50 + 20 = 70 after the second, so the 60th visitor is reached during the second class. Answer: the median lies in the class 10 ≤ t < 20. Watch which class each shortcut lands on: the tallest bar belongs to the first class, with the highest frequency density, 5 — but the tallest bar shows where visitors are packed most densely, not where the middle visitor falls, and picking it lands one class too early, at 0 ≤ t < 10; taking half of the total TIME span instead of half of the total NUMBER of visitors, 60 minutes ÷ 2 = 30 minutes, lands in the class 20 ≤ t < 40, confusing a value on the horizontal axis with a position in the data; and using the full 120 visitors as the target position, rather than 120 ÷ 2 = 60, reaches all the way to the last class, 40 ≤ t < 60, treating the whole data set's size as though it were the position of a single middle value.
12. (b) 12n — Distributing the minus sign across the second bracket gives n² + 6n + 9 − n² + 6n − 9, and the n² terms and the +9/−9 cancel, leaving 6n + 6n = 12n. Writing 18 comes from only negating the first term of the second bracket, n², and treating the −6n and +9 as unchanged, which gives n² + 6n + 9 − n² − 6n + 9 = 18. Writing 2n² + 18 comes from adding the two brackets instead of subtracting them, (n² + 6n + 9) + (n² − 6n + 9) = 2n² + 18. Writing 6n comes from correctly negating the bracket but then only counting one of the two 6n terms, missing that they add rather than cancel.
13. (d) 44 — Method: a cumulative frequency counts everything below a value, so the frequency of a class is the running total at the top of the class minus the running total at the bottom of it. Working: the running total below 20 kg is 96 and the running total below 10 kg is 52, so the number of boxes in the class 10 ≤ m < 20 is 96 − 52 = 44. Answer: 44 boxes. The distractors: 96 comes from quoting the running total at 20 kg itself, which counts every box below 20 kg rather than only those in this class; 34 comes from subtracting the wrong pair, 52 − 18, which gives the class 5 ≤ m < 10 instead; 54 comes from subtracting from the grand total, 150 − 96, which gives the boxes of 20 kg or more.
14. (c) 2.26 — Method: apply the formula repeatedly, keeping the whole display each time, and stop when two values in a row round to the same 2 decimal places; that shared rounded value is the solution to that accuracy. Working: x₁ = ∛(2 × 2 + 7) = ∛11 = 2.22398…; x₂ = ∛(2 × 2.22398… + 7) = ∛11.44796… = 2.25377…; x₃ = ∛11.50754… = 2.25767…; x₄ = ∛11.51534… = 2.25818…. Now x₃ and x₄ both round to 2.26, so the sequence has settled. Answer: 2.26. The distractors: 2.22 is x₁ rounded, quoted by a candidate who stops after one use of the formula; 2.25 is x₂ rounded, quoted by a candidate who stops as soon as two values look close instead of waiting until two consecutive values round to the same figure; 1.91 is ∛7, which comes from ignoring the 2x term and solving x³ = 7 instead.
15. (d) x₂ closer: f(x₂) = 0.0225, nearer to 0 — f(2.6) = 2.6² − 7 = 6.76 − 7 = −0.24, and f(2.65) = 2.65² − 7 = 7.0225 − 7 = 0.0225. The closer a value of x is to the root, the closer f(x) is to zero — regardless of sign. Since |0.0225| = 0.0225 is much smaller than |−0.24| = 0.24, x₂ = 2.65 is closer to the root. 'x₁ closer: −0.24 is the smaller value' comes from comparing the SIGNED values of f(x) rather than their distances from zero — −0.24 is indeed less than 0.0225 as a number, but that does not mean x₁ is closer to the root. 'x₁ closer: f(x₁) negative ⇒ nearer root' invents a rule that a negative f(x) means x is closer to the root; the sign of f(x) only tells you which side of the root x is on, not how close it is. 'x₂ is the exact root, since f(x₂) ≈ 0' misreads f(x₂) = 0.0225 as zero; the true root is √7 ≈ 2.6458, so f(2.65) is close to zero but not equal to it, and x₂ is an approximation, not the exact root.
16. (d) (6, 6) — y = f(x − 4) + 1 combines two translations: the −4 inside the brackets moves the graph 4 units to the RIGHT, and the +1 outside the brackets moves it 1 unit UP. Applying both to (2, 5): add 4 to the x-coordinate 2, and add 1 to the y-coordinate 5, giving (6, 6). Moving left instead of right, as the minus sign inside the bracket might suggest, gives (−2, 6) or (−2, 4); forgetting the horizontal shift altogether and only applying the vertical one gives (2, 6).
17. (a) xₙ₊₁ = ∛(5xₙ + 3) — Starting from x³ − 5x − 3 = 0, add 5x and 3 to both sides to get x³ = 5x + 3, then take the cube root of both sides: x = ∛(5x + 3), giving the iterative formula xₙ₊₁ = ∛(5xₙ + 3). A sign error when moving the constant term across, treating x³ − 5x − 3 = 0 as x³ = 5x − 3, gives xₙ₊₁ = ∛(5xₙ − 3). Swapping the coefficient of x with the constant term gives xₙ₊₁ = ∛(3xₙ + 5), which does not come from x³ = 5x + 3 at all. Treating cubing as meaning multiply by 3 rather than raise to the power 3, and so undoing it by dividing by 3 instead of taking a cube root, gives xₙ₊₁ = (5xₙ + 3) ÷ 3.
18. (c) Only x = 5 satisfies 3x + 5 = 20, not every value of x. — 3x + 5 = 20 is only true when x = 5, since 3 × 5 + 5 = 20; for any other value of x the two sides are not equal, so it is an equation, not an identity. Saying it cannot be simplified confuses simplifying with the equation/identity distinction, which is about how many values of x make it true. Saying it has an = sign is not a valid test, since identities are also written with an = or ≡ sign. A number on the right-hand side does not decide it either — what matters is whether both sides match for every value of x, not the form of the right-hand side.