🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (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.
2. (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.
3. (d) 25 — Method: the median is estimated at position n ÷ 2 in the cumulative frequency table, then interpolated across the class it falls in: lower boundary, plus the fraction of the way through the class, times the class width. Working: there are 80 sacks, so the median sits at position 80 ÷ 2 = 40. Before the class 20 ≤ m < 30 the cumulative frequency is 22, and by the end of it, it is 58, so this class holds the 40th sack; its frequency is 58 − 22 = 36 and its width is 30 − 20 = 10. The extra distance needed into the class is 40 − 22 = 18, and 18 ÷ 36 × 10 = 5, so the median is 20 + 5 = 25. Answer: the estimated median mass is 25 kg. Watch which numbers the interpolation uses: reading off just the lower boundary of the median class, 20, ignores how far into that class the 40th sack actually falls; treating n ÷ 2 = 40 itself as the median mass mistakes a position in the list for a mass in kilograms; and using the target position, 40, as the extra distance into the class instead of subtracting the sacks already counted changes the calculation to 20 + 40 ÷ 36 × 10. That comes to 20 + 11.1 = 31.1, overshooting the class because it never subtracts the 22 sacks already counted before it.
4. (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.
5. (b) f(1) = −3 and f(2) = 3 — f(1) = 1³ − 1 − 3 = 1 − 1 − 3 = −3. f(2) = 2³ − 2 − 3 = 8 − 2 − 3 = 3. Since f(1) is negative and f(2) is positive, there is a change of sign, so a solution lies between x = 1 and x = 2. Dropping the −x term entirely gives f(1) = 1 − 3 = −2 and f(2) = 8 − 3 = 5. Using x² instead of x³ throughout gives f(1) = 1 − 1 − 3 = −3, which happens to coincide with the correct value at x = 1, but f(2) = 4 − 2 − 3 = −1, which does not show a change of sign at all. Working out −f(x) instead of f(x), a sign-flip error, gives f(1) = 3 and f(2) = −3, the correct sizes but with both signs reversed.
6. (b) (n + 1)² − n² = 2n + 1 — (n + 1)² = n² + 2n + 1, so (n + 1)² − n² = n² + 2n + 1 − n² = 2n + 1, which is odd because it is one more than the even number 2n. Expanding (n + 1)² as n² + 1 uses the false rule (a + b)² = a² + b², and subtracting n² from that leaves just 1 — always expand (a + b)² as a² + 2ab + b². Writing n² + 2n + 1 expands correctly but never carries out the subtraction of n². Writing 2n forgets the constant term left after subtracting.
7. (b) (3, 10) — Method: multiply every part of p by 2, then add the matching parts of q. Working: 2p = (4, 6); adding q gives top 4 + (−1) = 3 and bottom 6 + 4 = 10. Answer: 2p + q = (3, 10). A candidate who forgets to double p first, working out p + q instead, gets (1, 7). A candidate who doubles q instead of p, working out p + 2q, gets (0, 11). A candidate who subtracts q instead of adding it, working out 2p − q, gets (5, 2).
8. (c) x = 0 — Expand (x + 4)² correctly: (x + 4)² = x² + 8x + 16. This equals x² + 16 only when 8x is zero, i.e. when x = 0 — at every other value of x the two expressions differ by 8x. Choosing x = 4 confuses the constant inside the bracket with the value of x that makes the expressions match. Choosing x = −4 makes the same confusion but with the sign flipped. Choosing x = 8 mistakes the coefficient of the middle term, 8x, for the value of x itself.
9. (c) −4 — f(2) = 7, and y = f(x) + a passing through (2, 3) means f(2) + a = 3, so 7 + a = 3, giving a = 3 − 7 = −4. Writing a = 4 comes from subtracting the wrong way round, 7 − 3 instead of 3 − 7. Writing a = 10 comes from adding the two y-values instead of subtracting one from the other. Writing a = 3 comes from taking the new y-coordinate as the value of a directly, without accounting for the original y-value of 7 at all.
10. (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).
11. (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.
12. (d) 12/17 — Method: the person picked is known to have passed, so the sample space is everyone who passed; divide the course takers who passed by that total. Working: 120 course takers and 50 others passed, so 170 people passed. The course takers who passed give 120/170, and dividing the numerator and the denominator by 10 gives 12/17. Answer: the probability is 12/17. The distractors: 4/5 is 120/150, the probability that someone passed given that they took the course, which reverses the condition and the event; 12/25 is 120/250, dividing by everyone who sat the test rather than by the 170 who passed; 17/25 is 170/250, the probability that a person picked from everyone sitting the test passed, which answers a different question altogether.
13. (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.
14. (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.
15. (c) 0.04 — Method: 'made by machine B and faulty' is the second branch of a tree followed after the first, so multiply the probability of machine B by the probability of a fault given machine B. Working: machine B makes 0.4 of the bolts, and 0.1 of those bolts are faulty, so the probability is 0.4 × 0.1 = 0.04. Answer: the probability is 0.04. The distractors: 0.5 comes from adding 0.4 and 0.1 instead of multiplying, treating two stages of one journey as two separate outcomes; 0.1 gives the fault rate for machine B on its own, as though every bolt in the factory came from machine B, so the 40% share is never used; 0.07 is 0.6 × 0.05 added to 0.4 × 0.1, the probability that a bolt is faulty whichever machine made it, which answers a question about all the production rather than about machine B.
16. (b) (6, 2) — The overall journey from house to park is the sum of the two vectors: top = 2 + 4 = 6, bottom = 5 + (−3) = 2, giving (6, 2). A candidate who subtracts the second vector from the first instead of adding gets (2 − 4, 5 − (−3)) = (−2, 8). A candidate who subtracts the other way round gets (4 − 2, −3 − 5) = (2, −8). A candidate who forgets the negative sign on the second vector's bottom number and adds 3 instead of −3 gets (6, 8). Because the journeys join end to end, the correct resultant vector is (6, 2).
17. (a) (3, 7) — y = f(x) + 5 is a vertical translation of y = f(x) by 5 units up — the translation vector is (0, 5) — so only the y-coordinate of any point changes. Turning point (3, 2) → (3, 2 + 5) = (3, 7). Adding the 5 to the x-coordinate, or treating it as a horizontal shift like y = f(x + 5), moves the wrong coordinate — check first whether the number sits inside or outside the brackets.
18. (c) (2n + 1)² + (2n + 3)² = (4n² + 4n + 1) + (4n² + 12n + 9) = 8n² + 16n + 10 = 8(n² + 2n + 1) + 2, and n² + 2n + 1 is an integer, so the sum is always 2 more than a multiple of 8. — Expand each square carefully: (2n + 1)² = 4n² + 4n + 1 and (2n + 3)² = 4n² + 12n + 9, since the cross term is 2 × 2n × 3 = 12n. Adding gives 8n² + 16n + 10, and factorising out 8 from every term that can hold one gives 8(n² + 2n + 1) + 2; since n² + 2n + 1 is always an integer, the sum is always 2 more than a multiple of 8. The attempt reaching 8(n² + 2n) + 10 has the correct expansion but stops the factorisation one step early — it never pulls a further 8 out of the 10 (10 = 8 + 2), so 'always 10 more than a multiple of 8' should be reduced to 'always 2 more than a multiple of 8'. The attempt reaching 2(4n² + 8n + 5) also has the correct expansion, and the factorisation is true, but 'always even' only shows the sum is a multiple of 2 — being even is necessary but nowhere near sufficient to be a multiple of 8, and the argument never finds the extra factor of 4. The fourth attempt makes an expansion slip, using (2n + 3)² = 4n² + 9 instead of 4n² + 12n + 9 — dropping the 12n cross term entirely — so it works from the wrong expression 8n² + 4n + 10 throughout, and no amount of correct working afterwards can recover the right conclusion.