🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (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.
2. (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.
3. (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.
4. (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.
5. (b) 6 — Reflecting y = f(x) in the x-axis turns the minimum point (2, −3) into a maximum point at (2, 3), since −f(x) negates every y-value: −(−3) = 3. Adding a then gives 3 + a = 9, so a = 9 − 3 = 6. Forgetting the reflection and using the original y-value of −3 gives −3 + a = 9, so a = 12 — this ignores that −f(x) changes the sign of the y-coordinate before a is added. Writing a = −12 comes from subtracting in the wrong order, working out 9 − (−3) as −3 − 9 instead. Writing a = −6 comes from taking the negative of the correct answer, as if the final value of a needed to be reflected too, on top of the turning point.
6. (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.
7. (a) 7 — Multiply the input by 2: 6 × 2 = 12. Then subtract 5: 12 − 5 = 7. A candidate who does the operations in the wrong order, subtracting 5 first and then multiplying by 2, gets (6 − 5) × 2 = 2. A candidate who only carries out the multiplication and forgets to subtract gets 12. A candidate who adds 5 instead of subtracting gets 6 × 2 + 5 = 17.
8. (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.
9. (b) 55 — Method: count the classes that lie wholly above 8 minutes, then use linear interpolation for the class that 8 cuts through, assuming the delays in that class are spread evenly. Working: the class 10 ≤ d < 20 lies wholly above 8 and holds 25 buses; the value 8 lies in the class 5 ≤ d < 10, which is 5 minutes wide and holds 75 buses, and the part above 8 runs from 8 to 10, a width of 2, so the estimated share is (2 ÷ 5) × 75 = 30 buses; the estimate is 30 + 25 = 55. Answer: about 55 refunds. The distractors: 100 comes from adding the whole of the class 5 ≤ d < 10, 75 + 25, and so refunding buses only 5 minutes late; 25 comes from using only the class 10 ≤ d < 20 and ignoring the part class that 8 minutes cuts through; 70 comes from taking the part of the class from 5 up to 8 instead of from 8 up to 10, giving (3 ÷ 5) × 75 = 45 and then 45 + 25.
10. (c) 14.1 — Method: in x² + y² = r² the right-hand side is the square of the radius, so take its square root to find the radius, then double the radius because the diameter is twice the radius. Working: r² = 50, so r = √50 = 7.07106…, and the diameter is 2 × 7.07106… = 14.14213…, which is 14.1 correct to 1 decimal place. Answer: 14.1. The distractors: 7.1 is the radius, worked out correctly but never doubled, so it answers a question about the radius rather than the diameter; 100.0 comes from doubling the 50 on the right-hand side, treating r² as though it were already the radius; 25.0 comes from halving the 50, treating r² as though it were already the diameter.
11. (c) −0.5 — fg(x) = f(g(x)) = f(x²) = x² + 2. gf(x) = g(f(x)) = g(x + 2) = (x + 2)² = x² + 4x + 4. Setting fg(x) = gf(x): x² + 2 = x² + 4x + 4. Subtract x² from both sides: 2 = 4x + 4. Subtract 4 from both sides: −2 = 4x, so x = −0.5. Writing 1.5 comes from adding the 4 instead of subtracting it: 4x = 2 + 4 = 6, giving x = 1.5. Writing 'no solution' comes from expanding (x + 2)² as x² + 4 using (a + b)² = a² + b², losing the middle term — the equation then reads x² + 2 = x² + 4, which has no solution, but the expansion itself is wrong. Writing 0 comes from treating gf(x) as g(x) + f(x) instead of g(f(x)): x² + (x + 2) = x² + 2 gives x = 0, but that adds the two functions rather than composing them.
12. (d) £16.70 — The mileage charge is 2.20 × 6 = £13.20. Adding the fixed fee: £13.20 + £3.50 = £16.70. A candidate who forgets the fixed fee gives just the mileage charge, £13.20. A candidate who adds the fixed fee to the per-mile rate before multiplying by the number of miles, (3.50 + 2.20) × 6, gets £34.20. A candidate who rounds £2.20 down to £2 gets 2 × 6 + 3.50 = £15.50.
13. (a) 2.154 — Continuing xₙ₊₁ = ∛(3xₙ + 4) from x₁ = 2.154 gives x₂ = 2.187, x₃ = 2.195, settling towards the root near 2.196 — this is the formula that converges. Continuing xₙ₊₁ = (xₙ³ − 4) ÷ 3 from x₁ = 1.333 gives x₂ = −0.543 and then x₃ = −1.387, moving further from the root each time. Continuing xₙ₊₁ = 4 ÷ (xₙ² − 3) from x₁ = 4 gives x₂ = 0.308 and then x₃ = −1.377, swinging wildly rather than settling. Continuing xₙ₊₁ = xₙ³ − 2xₙ − 4 from x₁ = 0 gives x₂ = −4 and then x₃ = −60, running away from the root entirely.
14. (a) (9, −5) — Method: multiply every part of q by 2, then subtract the matching part from p. Working: 2q = (−4, 6); p − 2q gives top 5 − (−4) = 9 and bottom 1 − 6 = −5. Answer: p − 2q = (9, −5). A candidate who forgets to double q first, working out p − q instead, gets (7, −2). A candidate who doubles p instead of q, working out 2p − q, gets (12, −1). A candidate who adds 2q instead of subtracting it gets (1, 7).
15. (a) 1.36 — Method: put the starting value into the right-hand side to get x₁, feed that value back in to get x₂, and round only once the second value has been found. Working: x₁ = 5 ÷ (1 + 2) = 5 ÷ 3 = 1.66666…; x₂ = 5 ÷ (1.66666… + 2) = 5 ÷ 3.66666… = 1.36363…. The digit in the third decimal place is 3, so x₂ = 1.36 correct to 2 decimal places. Answer: 1.36. The distractors: 1.67 is x₁, the value after a single use of the formula, given by a candidate who counts the starting value itself as x₁; 1.49 is x₃ = 1.48648…, one use of the formula too many; 1.37 comes from writing x₁ down as 1.66, truncating the display instead of keeping it in full, and then working out 5 ÷ 3.66 = 1.36612…, which rounds up to 1.37.
16. (c) A reflection in the y-axis — Replacing x with −x reflects the graph in the y-axis: each point (x, y) maps to (−x, y). Reflecting the OUTPUT instead, y = −f(x), gives a reflection in the x-axis — that is a different function. Combining both reflections gives a rotation of 180° about the origin, and reflecting in the line y = x swaps the x- and y-values, which is what produces the inverse function, not f(−x). Check first which side of f the minus sign sits on.
17. (c) Statement (ii) — Statement (ii) opens with 'Since n(n + 1) is even', treating the very fact the proof is meant to establish as if it were already known — that is circular reasoning, assuming the conclusion to help derive itself. Statement (i) only names the two consecutive integers as n and n + 1; it makes no claim about whether their product is even, so it introduces nothing circular. Statement (iii) states the conclusion, and would be a valid final step if statement (ii) had reached 'one of n and n + 1 is even' by a genuine argument, such as considering the cases where n is even or odd separately. Saying the proof assumes nothing circular is wrong, because statement (ii)'s opening clause is exactly that assumption.
18. (a) (4, −8), a minimum point — The transformation x → x + 1 inside f translates the graph 1 unit to the LEFT, so the x-coordinate becomes 5 − 1 = 4. The minus sign in front of f reflects the graph in the x-axis, so the y-coordinate becomes −8, and a reflection in the x-axis turns every maximum into a minimum, so (4, −8) is a minimum point. Writing '(4, −8), a maximum point' gets the coordinates right but forgets that a reflection in the x-axis swaps maximum and minimum points. Writing '(6, −8), a minimum point' comes from translating 1 unit to the RIGHT instead of the left — f(x + 1) always moves the graph in the negative x-direction. Writing '(4, 8), a minimum point' gets the x-coordinate and the type right, but forgets to actually negate the y-coordinate, even though it does correctly reclassify the point as a minimum.