🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (b) It is not even an ordinary equation with a solution: expanding the left-hand side gives 3x − 12, and 3x − 12 = 3x − 4 would require −12 = −4, which is never true. — Expanding the left-hand side, 3(x − 4) = 3x − 12. Setting this equal to the right-hand side, 3x − 12 = 3x − 4, gives −12 = −4 once the 3x terms are removed from both sides — a statement that is never true, so no value of x satisfies the equation at all, and it is certainly not an identity. The option about substituting a specific value misunderstands algebraic expansion, which holds for every x, not one chosen value. The option matching the first term wrongly assumes that is enough to prove equivalence. The option about multiplying the 4 by 3 on both sides is nonsensical, since there is only one bracket to expand, on the left-hand side.
2. (c) The sequence diverges, moving away from x = 3 — Starting from x₀ = 2.9: x₁ = 2.9² − 6 = 2.41, x₂ = 2.41² − 6 = −0.19, x₃ = (−0.19)² − 6 = −5.96, x₄ = (−5.96)² − 6 = 29.56 — the values swing away from 3 and grow rapidly, so the sequence diverges rather than settling anywhere. Choosing 'settles towards x = 3' assumes that starting close to a root is enough for a rearrangement to converge to it, which is not always true — this rearrangement changes values too steeply near x = 3 to stay there. Choosing 'settles towards x = −2' assumes a diverging sequence must eventually land on the other root; instead it runs away to increasingly large values. Choosing 'stays constant at 2.9' ignores that applying the formula changes the value at every step.
3. (c) 2.61 — The limit L satisfies L = 12 ÷ (L + 2), so L(L + 2) = 12, giving L² + 2L − 12 = 0 and L = (−2 + √52) ÷ 2 = 2.6056, which is 2.61 to 2 decimal places (the early iterates 4, 2, 3, 2.4, 2.73, ... oscillate around this value before settling). Choosing 3.00 reads off x₃, one of the early oscillating values, before the sequence has settled close to the limit. Choosing 4.00 reads off x₁, the very first iterate, not the value the sequence approaches. Choosing 6.00 comes from writing the limit equation as L = 12 ÷ 2, leaving L itself out of the denominator.
4. (b) xₙ₊₁ = (xₙ² + 3) ÷ 5 — Starting from x² = 5x − 3, add 3 to both sides: x² + 3 = 5x. Divide both sides by 5: x = (x² + 3) ÷ 5. Writing this as an iteration gives xₙ₊₁ = (xₙ² + 3) ÷ 5. xₙ₊₁ = (xₙ² − 3) ÷ 5 comes from a sign error when moving the −3 across the equals sign — it should become +3, not stay as −3. xₙ₊₁ = 5(xₙ² + 3) comes from multiplying by 5 instead of dividing by 5 when isolating x. xₙ₊₁ = (xₙ + 3) ÷ 5 comes from dropping the index on x², using xₙ instead of xₙ².
5. (d) (−2, 6) — Method: add the top numbers of both vectors to the starting x-coordinate, and the bottom numbers of both vectors to the starting y-coordinate. Working: x-coordinate 2 + 3 + (−7) = −2; y-coordinate −1 + 5 + 2 = 6. Answer: (−2, 6). A candidate who only applies vector u and forgets v gets (5, 4). A candidate who only applies vector v and forgets u gets (−5, 1). A candidate who works out the combined vector u + v but forgets to add it to the starting point gets (−4, 7).
6. (a) (4, 1) — y = −f(x) reflects the graph of y = f(x) in the x-axis: every point (x, y) maps to (x, −y). Applying this to (4, −1): the x-coordinate stays 4, and the y-coordinate −1 becomes its negative, 1. Leaving the y-coordinate unchanged skips the reflection entirely, giving (4, −1); reflecting the x-coordinate instead, or reflecting both, mixes this up with a reflection in the y-axis or a rotation, giving (−4, −1) or (−4, 1).
7. (d) a = 4 — Expand the left-hand side: (2x + 3)(x + a) = 2x² + 2ax + 3x + 3a = 2x² + (2a + 3)x + 3a. For this to match 2x² + 11x + 12 for every value of x, the x-coefficients must be equal and the constants must be equal: 2a + 3 = 11 and 3a = 12. Both give a = 4, so a = 4. Writing a = 12 comes from the constant-term equation 3a = 12: reading it as saying a itself is 12, rather than dividing both sides by 3. Writing a = 8 comes from the x-coefficient equation 2a + 3 = 11: working out 11 − 3 = 8 correctly but then stopping, without dividing by the 2 in front of a. Writing a = −4 comes from rearranging 2a + 3 = 11 the wrong way round, as 2a = 3 − 11 = −8, which gives a = −4 instead of a = 4.
8. (d) (2/5)a + (3/5)b — Method: OP = OA + AP, and since AP : PB = 3 : 2 splits AB into 5 equal parts, AP is 3/5 of the whole of AB, with AB = b − a. Working: OP = a + 3/5(b − a) = a − (3/5)a + (3/5)b = (2/5)a + (3/5)b. Answer: OP = (2/5)a + (3/5)b. Using the ratio the wrong way round, as though it read AP : PB = 2 : 3, gives (3/5)a + (2/5)b; adding (3/5)b onto the whole of a without subtracting a inside the bracket first gives a + (3/5)b; and treating the ratio as 1 : 1 gives the midpoint, (1/2)a + (1/2)b. Convert the ratio to a fraction of AB measured from A, matching the ORDER the ratio is stated in, and subtract before you scale.
9. (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.
10. (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.
11. (c) 76 — Method: the frequency of each class is the area of its bar, frequency density × class width, so work out all three frequencies and add them. Working: the widths are 5, 10 and 25 kg, so the frequencies are 4 × 5 = 20, 2.6 × 10 = 26 and 1.2 × 25 = 30; the total is 20 + 26 + 30 = 76. Answer: 76 dogs. The distractors: 7.8 comes from adding the three frequency densities, 4 + 2.6 + 1.2, treating each height as though it were a count; 107 comes from using each upper class boundary as the width, giving 4 × 5, 2.6 × 15 and 1.2 × 40; 39 comes from using the first class width, 5, for every bar, which ignores the unequal intervals and gives 20 + 13 + 6.
12. (d) x = −2, x = 6; y-intercept (0, 12) — Reflecting y = f(x) in the x-axis, to get y = −f(x), negates every y-value but leaves every x-value fixed. The x-intercepts happen where y = 0, and −0 = 0, so they are unaffected: y = −f(x) still crosses the x-axis at x = −2 and x = 6. The y-intercept is the value at x = 0: f(0) = −12, so −f(0) = 12, giving the point (0, 12) — the sign flips because the y-intercept is a nonzero y-value, unlike the roots. Writing 'x = 2, x = −6; y-intercept (0, −12)' comes from confusing −f(x) with f(−x) — reflecting in the y-axis instead of the x-axis, which negates the x-values of the intercepts (turning −2 into 2 and 6 into −6) but leaves f(0) unchanged, since f(−0) = f(0) = −12. Writing 'x = −2, x = 6; y-intercept (0, −12)' comes from forgetting that −f(x) is a reflection at all, and assumes both intercepts stay exactly as they were. Writing 'x = 2, x = −6; y-intercept (0, 12)' correctly negates the y-intercept but wrongly negates the x-intercepts too, as if a reflection in the x-axis also flipped the sign of every x-value.
13. (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.
14. (a) 16 — A and B share the same y-coordinate, so the distance between them is the horizontal difference between their x-coordinates: 8 − (−8) = 16, giving a chord of length 16. Choosing 8 gives only the x-coordinate of one point, not the full distance between the two points. Choosing 34 is the diameter of the circle (2 × 17), not the length of this particular chord. Choosing 17 is the radius — the distance from the centre to A or to B, not from A to B.
15. (b) Translate −90° in x, then translate −2 in y. — cos(x + 90°) translates the graph 90° in the NEGATIVE x-direction, since a positive shift inside the bracket moves a graph left, not right, and subtracting 2 afterwards translates it 2 units in the negative y-direction (down). So the sequence is: translate −90° in x, then translate −2 in y. Using +90° in x reverses the direction of the horizontal shift — the sign inside the bracket moves the graph the opposite way to what it looks like. Using +2 in y reverses the direction of the vertical shift; subtracting 2 outside the function moves the graph down, not up. Describing the −2 as a reflection in the x-axis is wrong because a reflection turns positive y-values negative and vice versa, whereas here every y-value is simply reduced by the fixed amount 2, which is what a translation does, not a reflection.
16. (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.
17. (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.
18. (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.