🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (d) 2 — Method: if f is 3 times e, then each part of f equals 3 times the matching part of e. Working: using the bottom numbers, 6 = 3 × k, so k = 2. Answer: k = 2. A candidate who multiplies instead of dividing, working out 6 × 3, gets 18. A candidate who uses the top numbers' ratio instead, 15 ÷ 5, and gives that ratio as k gets 3. A candidate who adds instead of using the multiple relationship, working out 6 + 3, gets 9.
2. (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.
3. (c) n = 4 — Testing n = 4: 4² = 16, and 16 + 4 + 1 = 21, and 21 = 3 × 7 is not a prime number, so this value disproves the claim. Testing n = 1: 1² = 1, and 1 + 1 + 1 = 3, which is prime, so it does not disprove the claim. Testing n = 2: 2² = 4, and 4 + 2 + 1 = 7, which is prime. Testing n = 3: 3² = 9, and 9 + 3 + 1 = 13, which is also prime — a counterexample has to give a result that isn't prime, and only n = 4 does that.
4. (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).
5. (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.
6. (b) £105 — The hourly charge is 25 × 3 = £75. Adding the call-out fee: £75 + £30 = £105. A candidate who forgets the call-out fee gives just the hourly charge, £75. A candidate who adds the call-out fee to the hourly rate before multiplying by the hours, (30 + 25) × 3, gets £165. A candidate who multiplies the call-out fee by the number of hours instead of the hourly rate, 30 × 3, gets £90.
7. (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.
8. (d) 2√2 — The radius satisfies r² = 8, so r = √8 = √(4 × 2) = √4 × √2 = 2√2. Choosing 8 forgets to take the square root of r² at all. Choosing 4 comes from halving 8 instead of finding its square root. Choosing √2 splits off the factor of 4 correctly but forgets to multiply the 2 back in front of the root.
9. (b) 25 — The tangent at (9, 12) is 9x + 12y = 225. Setting y = 0 (the x-axis): 9x = 225, so x = 25. Choosing 18.75 comes from swapping the coefficients in the tangent equation (using 12x + 9y = 225) before setting y = 0. Choosing 15 is where the circle itself meets the x-axis (from x² = 225), not where the tangent does. Choosing 9 is just the x-coordinate of the original point (9, 12), not the point P.
10. (b) x² + y² = 1369 — For a circle centred at the origin, the radius squared equals the sum of the squares of the coordinates of any point on it: r² = 12² + 35² = 144 + 1225 = 1369. The equation is x² + y² = 1369. x² + y² = 2209 comes from adding the coordinates first and then squaring the sum: (12 + 35)² = 47² = 2209, instead of squaring each coordinate separately. x² + y² = 1225 comes from using only 35² and leaving out the 12² term. x² + y² = 144 comes from using only 12² and leaving out the 35² term.
11. (b) −3/4 — The tangent to a circle at a point is always perpendicular to the radius drawn to that point. The radius from (0, 0) to (3, 4) has gradient 4/3. The gradient of a line perpendicular to a line with gradient m is the negative reciprocal, −1/m, so the tangent's gradient here is −3/4. Using the radius's own gradient, forgetting that the tangent is perpendicular to it, gives 4/3. Negating the radius's gradient without also taking the reciprocal gives −4/3. Taking the reciprocal of the radius's gradient without negating it gives 3/4.
12. (a) 4(x + 3) = 20 and 4x + 3 = 11 when x = 2, so the two expressions are not equivalent, because the bracket means the 3 must be added before multiplying by 4. — Substituting x = 2: 4(x + 3) = 4 × 5 = 20, and 4x + 3 = 8 + 3 = 11. The two values are different, and expanding 4(x + 3) algebraically gives 4x + 12, which can never equal 4x + 3 (that would require 12 = 3) — so the two expressions are never equivalent, for any value of x. The option claiming they become equal for a larger x is wrong: 4x + 12 = 4x + 3 has no solution at all. The option claiming they are equivalent because they share the terms 4x and 3 ignores that the bracket changes the constant term. The option that calculates 4(x + 3) as 11 ignores the bracket completely, applying the 4 only to the x term.
13. (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.
14. (d) −2 — Method: run the machine backwards, undoing the operations in the opposite order and swapping each one for its inverse. Working: the machine added 7 last, so take 7 off the output: 1 − 7 = −6; before that the machine had multiplied by 3, so divide: −6 ÷ 3, and a negative divided by a positive stays negative. Answer: −2, which checks because 3 × (−2) + 7 = −6 + 7 = 1. The distractors: 2 comes from dividing 6 by 3 and losing the minus sign; −6 comes from taking the 7 off and stopping there, never undoing the multiplication; −18 comes from multiplying −6 by 3 instead of dividing by 3.
15. (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.
16. (a) (30, 60) — Method: a cumulative frequency point is plotted at the upper boundary of its class, paired with the running total of all the frequencies up to and including that class. Working: the running totals are 7, then 7 + 19 = 26, then 26 + 34 = 60, then 60 + 40 = 100; the class 20 ≤ t < 30 has upper boundary 30, and the running total there is 60. Answer: the point for that class is plotted at 30 seconds against a cumulative frequency of 60. The distractors: (25, 60) comes from plotting at the class midpoint, which is what a frequency polygon uses and not what a cumulative frequency diagram uses; (30, 34) comes from plotting the class frequency, 34, rather than the running total; (20, 60) comes from plotting at the lower boundary of the class, which would claim that 60 calls took less than 20 seconds when only 26 did.
17. (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.
18. (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.