🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (a) 3 — y = f(x + 2) is f(x) translated 2 units to the LEFT (inside the bracket, adding moves the graph in the negative x-direction). The root moves with the whole graph: 5 − 2 = 3. Moving right instead of left gives 7; assuming a bracket shift leaves the root unchanged gives 5; writing down the shift amount 2 itself skips the translation altogether.
2. (b) 3 — At the limit, L = √(2L + 3). Squaring both sides: L² = 2L + 3, so L² − 2L − 3 = 0, which factorises as (L − 3)(L + 1) = 0, giving L = 3 or L = −1. Since the sequence of iterates stays positive throughout, the limit is L = 3. Taking the other, negative root without rejecting it gives −1. Treating the equation L = 2L + 3 as already linear, forgetting to square both sides first, gives −L = 3, so L = −3. A sign error when factorising, writing (L + 3)(L − 1) = 0 instead of (L − 3)(L + 1) = 0, gives L = 1.
3. (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.
4. (d) Reflect in the y-axis, +2 in x; roots 3, −2 — f(2 − x) is zero exactly when 2 − x equals one of f's roots: 2 − x = −1 or 2 − x = 4. Solving each correctly (x = 2 − (−1) = 3, and x = 2 − 4 = −2) gives the new roots x = 3 and x = −2. This is the same as reflecting y = f(x) in the y-axis to get f(−x), then translating 2 units in the positive x-direction to get f(−(x − 2)) = f(2 − x). Solving 2 − x = k as x = k − 2 instead of x = 2 − k is a sign slip when rearranging, and gives x = −3 and x = 2. Translating +2 in x with no reflection at all uses f(x − 2), whose roots are the original roots plus 2: x = 1 and x = 6 — this misses the reflection completely. Assuming 'no overall change' wrongly treats a reflection-and-translation pair as always cancelling out, when here the roots genuinely move, from x = −1 and x = 4 to x = 3 and x = −2.
5. (d) −2 — y = f(x) − 6 is f(x) shifted down by 6, so every y-value on the graph decreases by 6. At x = 0, f(0) = 4, so the new y-value is 4 − 6 = −2. Adding 6 instead of subtracting gives 10; writing down the shift itself, −6, or leaving the original value 4 unchanged both skip the translation altogether.
6. (b) Translate +5 in x, then reflect in the x-axis. — Translating y = x² by 5 units in the positive x-direction gives y = (x − 5)². Reflecting this in the x-axis, which replaces y with −y, gives y = −(x − 5)², matching the target. Using a translation of −5 in x instead gives y = (x + 5)², and reflecting that in the x-axis gives y = −(x + 5)² — the sign inside the bracket is wrong. Reflecting in the y-axis first does nothing to y = x², since (−x)² = x², so translating afterwards only reaches y = (x − 5)² with no negative sign at all. Translating by 5 units in y instead of x gives y = x² + 5, and reflecting that in the x-axis gives y = −x² − 5, a different curve altogether — a vertical shift does not create the (x − 5)² term the target equation needs.
7. (b) a = 7; turning point (4, 2) — A vertical translation y = f(x) + a moves every point on the graph up or down by a, so the x-coordinate of the turning point stays at 4 and the minimum value becomes −5 + a. Setting −5 + a = 2 and solving gives a = 7, so the new turning point is (4, 2). Rearranging −5 + a = 2 with a sign error, treating it as a = −5 − 2, gives a = −7 while still landing on the correct turning-point coordinates. Correctly finding a = 7 but then writing down the original turning point instead of the shifted one gives (4, −5). Assuming a is simply equal to the new minimum value itself, ignoring the original −5 entirely, gives a = 2.
8. (b) 3.38 — r₁ = √(300 ÷ (π × 8)) = √11.9366 = 3.4550. r₂ = √(300 ÷ (π × 8.4550)) = √11.2947 = 3.3608. r₃ = √(300 ÷ (π × 8.3608)) = √11.4232 = 3.3798, which rounds to 3.38. Choosing 3.36 stops at r₂, one iteration too early. Choosing 4.82 leaves out the '+ 5' inside the bracket, dividing by π × rₙ instead of π × (rₙ + 5). Choosing 3.45 comes from using π ≈ 3 instead of the calculator's π key throughout.
9. (c) xₙ₊₁ = ∛(9 − 4xₙ) — Method: a formula xₙ₊₁ = f(xₙ) is a correct rearrangement when the equation x = f(x) turns back into the equation you started with, so rearrange x³ + 4x − 9 = 0 by making the cube the subject. Working: x³ + 4x − 9 = 0 gives x³ = 9 − 4x, because the 4x and the 9 each change sign as they cross the equals sign; taking the cube root of both sides gives x = ∛(9 − 4x), which is the formula xₙ₊₁ = ∛(9 − 4xₙ). Answer: xₙ₊₁ = ∛(9 − 4xₙ). The distractors: ∛(9 + 4xₙ) comes from writing x³ = 9 + 4x, moving the 4x across the equals sign without changing its sign; (9 + xₙ³)/4 comes from making the linear term the subject but keeping the sign of the cube, writing 4x = 9 + x³ when the equation gives 4x = 9 − x³; ∛(9 − 4xₙ³) cubes the x in the linear term as well, changing a term the original equation never cubed.
10. (b) 4.39 — x₁ = ∛(150 − 3 × 4²) = ∛(150 − 48) = ∛102 = 4.672 (unrounded). x₂ = ∛(150 − 3 × 4.672²) = ∛(150 − 65.49) = ∛84.51 = 4.39 (2 d.p.). Choosing 4.67 stops after only one iteration, giving x₁ instead of x₂. Choosing 84.51 finds the value inside the cube root for x₂ but never takes the cube root. Choosing 6.32 comes from adding 3xₙ² instead of subtracting it inside the root, which does not match the given formula.
11. (d) It diverges, growing rapidly without limit. — x₁ = 2³ − 2 = 8 − 2 = 6. x₂ = 6³ − 2 = 216 − 2 = 214. x₃ = 214³ − 2 = 9800344 − 2 = 9800342. The values 6, 214, 9800342, … grow far larger at every step, so the sequence diverges rather than settling anywhere. Checking whether the sequence converges to a fixed value near 2 fails, since the terms grow enormously instead of levelling off. Checking for a repeating pair of values also fails, since 6, 214 and 9800342 are all different, with no sign of a return to 6. x₀ = 2 is a fixed point only if 2³ − 2 = 2, but 2³ − 2 = 6, not 2, so the sequence does not stay constant.
12. (d) (−4, −3) — The combined translation is the sum of the two column vectors, added component by component: top numbers 3 + (−7) = −4, bottom numbers −5 + 2 = −3, giving (−4, −3). (10, −7) subtracts the second vector from the first instead of adding them. (−4, 3) gets the top number right but makes a sign error on the bottom, treating −5 + 2 as +3. (4, −3) gets the bottom number right but makes a sign error on the top, treating 3 + (−7) as +4.
13. (a) x = 2, x = 7; y-intercept cannot be found here — Translating y = f(x) to y = f(x − 3) shifts the graph 3 units to the right, so each root increases by 3: x = −1 becomes x = 2, and x = 4 becomes x = 7. The y-intercept is the value at x = 0, which for this new graph is f(0 − 3) = f(−3) — and f(−3) is not one of the values given, so the new y-intercept cannot be worked out from the information given. Writing 'y-intercept stays at (0, −8)' wrongly assumes a horizontal translation leaves the y-intercept unchanged — it generally does not, since it moves the whole graph sideways, including the point that used to sit on the y-axis. Writing roots at x = −4 and x = 1 comes from translating 3 units to the LEFT instead of to the right — f(x − 3) shifts the graph in the positive x-direction, not the negative direction.
14. (d) g is one-to-one: f(3) = f(−3), removed by x ≥ 0 — A function has an inverse only if it is one-to-one: every output must come from exactly one input. f(3) = 9 and f(−3) = 9, so two different inputs give the same output, and there is no way to send 9 back to a single input — f is not one-to-one over all real x. Restricting the domain to x ≥ 0 removes one of the two inputs behind every such pair, so g is one-to-one and does have an inverse. 'g's outputs are positive; f's could be negative' is wrong because f(x) = x² also only gives outputs of 0 or more — the outputs of f and g are identical sets; it is the INPUTS that differ, not the outputs. 'Restricting any domain always creates an inverse' is wrong because a restriction only helps if it actually removes the repeated outputs: restricting f(x) = x² to x ≥ −3 still leaves f(1) = f(−1) = 1, so that restricted function is still not one-to-one and still has no inverse. 'Squares can never be reversed, under any conditions' is wrong because √9 = 3 does reverse 3² = 9 once you know the input was non-negative — a square root just cannot tell you WHICH of two inputs you started from unless the domain has already ruled one of them out.
15. (b) 1/3 — Method: the first sweet has already been taken and it was red, so work out the second probability from what is actually left in the bag. Working: one red sweet has gone, so 3 red sweets remain out of 9 sweets altogether, giving 3/9. Dividing the numerator and the denominator by 3 gives 1/3. Answer: the probability is 1/3. The distractors: 2/5 is 4/10, the probability for the first draw used again, which is only right if the first sweet is put back; 3/10 takes one off the red count but leaves the total at 10, updating half of the fraction; 4/9 takes one off the total but leaves the red count at 4, updating the other half of the fraction.
16. (b) y = −3x/4 + 25 — Method: a straight line that touches a circle at one point is a tangent there, so it is perpendicular to the radius drawn to that point; find the gradient of the radius, take its negative reciprocal, then substitute the point of contact into y − y₁ = m(x − x₁). Working: the radius from (0, 0) to (12, 16) has gradient 16 ÷ 12, which cancels to 4/3, so the tangent has gradient −3/4. Substituting gives y − 16 = −3/4(x − 12), so y − 16 = −3x/4 + 9 and y = −3x/4 + 25. Answer: y = −3x/4 + 25. The distractors: y = 3x/4 + 7 turns the gradient of the radius upside down but leaves it positive, so the perpendicular step is only half done; y = −4x/3 + 32 changes the sign of the radius gradient without turning it upside down, which is the other half left undone; y = −3x/4 − 25 uses the correct gradient but substitutes the point of contact with both signs reversed, writing y + 16 = −3/4(x + 12).
17. (b) 5 ≤ m < 10 — Method: with 60 values the median is the 60 ÷ 2 = 30th value in order, so build a running total until it first reaches 30. Working: the running totals are 22 after the first class, 22 + 20 = 42 after the second, 51 after the third, 56 after the fourth and 60 after the fifth; the 30th parcel is past 22 but not past 42, so it lies in the second class. Answer: the median lies in the class 5 ≤ m < 10. The distractors: 0 ≤ m < 5 comes from giving the class with the greatest frequency, 22, which is the modal class and not the median class; 10 ≤ m < 20 comes from choosing the middle class in the list of five instead of counting to the middle value; 20 ≤ m < 30 comes from halving the range of the data, 50 ÷ 2 = 25, and giving the class that contains 25 kg rather than the class that contains the 30th parcel.
18. (d) −3 — Substitute y = 11 into y = 5 − 2x, giving 11 = 5 − 2x. Subtracting 5 from both sides gives 6 = −2x, so x = 6 ÷ (−2) = −3. A candidate who mishandles the negative sign when rearranging, treating the equation as 6 = 2x, gets x = 3. A candidate who correctly finds −2x = 6 but forgets to divide by 2 at all gets x = 6. A candidate who adds 5 and 11 instead of subtracting, getting 2x = 16, gets x = 8.