🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (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.
2. (d) 11 — f⁻¹(x) = 5 means x = f(5), since applying f to both sides undoes the inverse. f(5) = 2 × 5 + 1 = 11. Writing 2 comes from confusing f⁻¹(x) = 5 with f(x) = 5, and solving 2x + 1 = 5 instead: 2x = 4, x = 2. Writing 9 comes from finding f⁻¹(x) with a sign error, f⁻¹(x) = (x + 1)/2 instead of (x − 1)/2, then setting this equal to 5: x + 1 = 10, x = 9. Writing 6 comes from finding f⁻¹(x) without dividing by 2 at all, f⁻¹(x) = x − 1, then setting this equal to 5: x = 6.
3. (c) 145 g — Method: find the position of the median from the total frequency, locate the class that contains it, then use linear interpolation inside that class, assuming the apples in it are spread evenly. Working: the median is the 100 ÷ 2 = 50th apple; the running totals are 10, then 10 + 30 = 40, then 40 + 40 = 80, so the 50th apple lies in the class 140 ≤ m < 160; it is the 50 − 40 = 10th of the 40 apples in that class, and the class is 20 g wide, so the median is 140 + (10 ÷ 40) × 20 = 140 + 5 = 145. Answer: an estimated median of 145 g. The distractors: 150 g comes from giving the midpoint of the class that contains the median instead of interpolating inside it; 140 g comes from stopping at the lower boundary of that class, which locates the class but not the value; 155 g comes from measuring the 5 g step down from the upper boundary, 160 − 5, instead of up from the lower boundary.
4. (c) y = x² — Method: test a candidate rule against every pair given, not just one — a rule that fits one pair and fails another is not the rule. Working: the outputs 1, 4, 9 rise by 3 and then by 5, so they are not going up in equal steps and the input is not simply multiplied by a fixed number; comparing each output with its own input gives 1 × 1 = 1, 2 × 2 = 4 and 3 × 3 = 9, and all three pairs fit. Answer: y = x². The distractors: y = 3x comes from fitting only the last pair, where 3 × 3 = 9, and reading that 3 as a multiplier; y = 3x − 2 comes from assuming a multiply-then-add rule and using the first step in the outputs, 4 − 1 = 3, as the multiplier — it fits the first two pairs and fails the third; y = 2x comes from fitting only the pair 2 and 4 and reading every output as double its input.
5. (d) 45 — Method: a cumulative frequency is a running total — it counts everybody in every class up to and including the one that ends at the value given. Working: the classes that lie wholly below 30 minutes are 0 ≤ t < 10, 10 ≤ t < 20 and 20 ≤ t < 30, with frequencies 6, 14 and 25, so the running total is 6 + 14 = 20 and then 20 + 25 = 45. Answer: 45 people took less than 30 minutes. The distractors: 25 comes from quoting the frequency of the class 20 ≤ t < 30 on its own instead of the running total; 65 comes from accumulating one class too many and including 30 ≤ t < 40, which is 45 + 20; 35 comes from accumulating from the top downwards, 15 + 20, which counts the people who took 30 minutes or more rather than fewer.
6. (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).
7. (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.
8. (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.
9. (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).
10. (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.
11. (c) 1 — At x = 0, f(0) = 4. Applying the transformations in order — reflect in the x-axis first, then translate up by 5 — gives −f(0) + 5 = −4 + 5 = 1. Applying the translation but forgetting the reflection gives f(0) + 5 = 9. Applying the reflection to the whole expression, including the +5, gives −f(0) − 5 = −9. Applying the reflection but forgetting the translation gives −f(0) = −4.
12. (c) y = 3x + 2 — Method: divide the change in the outputs by the change in the inputs to find the multiplier, then put one pair of values into the rule to find the number added on. Working: the output rises by 11 − 5 = 6 while the input rises by 3 − 1 = 2, so the multiplier is 6 ÷ 2 = 3; with an input of 1, 3 × 1 = 3 and the output is 5, so 2 is added. Answer: y = 3x + 2, checked against the second pair by 3 × 3 + 2 = 11. The distractors: y = 3x − 2 comes from finding the multiplier 3 and then subtracting the 2 instead of adding it; y = 2x + 3 comes from swapping the multiplier and the number added on; y = x + 4 comes from assuming the input is multiplied by 1 and using 5 − 1 = 4 as the number added on.
13. (b) y = f(−x) — y = f(−x) reflects the graph of y = f(x) in the y-axis: every x-coordinate changes sign. The x-intercepts −3 and 7 become 3 and −7, matching the second graph's intercepts −7 and 3. A point already on the y-axis is unaffected, since −0 = 0, so the y-intercept (0, 21) stays exactly where it is — matching the second graph as well. y = −f(x) leaves the x-intercepts unchanged at −3 and 7, since f(x) = 0 exactly where −f(x) = 0, which does not match; it also sends the y-intercept to (0, −21), a second mismatch. y = −f(−x) does send the x-intercepts to the right places, −7 and 3, but it sends the y-intercept to (0, −21) instead of (0, 21), so it fails the second clue. y = f(x) − 4 moves every point down 4, sending the y-intercept to (0, 17) instead of (0, 21), so it fails the y-axis clue. Test each option against BOTH clues — the pair of x-intercepts and the point on the y-axis — because more than one option gets only one of the two right.
14. (c) (10.5, −2) — Method: the vector from the first tile to the third tile is the pattern's vector doubled, since two translations happen between them. Working: doubling (4.5, −2.5) gives (9, −5); adding this to the starting corner (1.5, 3) gives x-coordinate 1.5 + 9 = 10.5 and y-coordinate 3 − 5 = −2. Answer: (10.5, −2). A candidate who only applies the vector once, translating to the second tile instead of the third, gets (6, 0.5). A candidate who adds 2.5 instead of subtracting it in the y-coordinate gets (10.5, 8). A candidate who doubles the x-part of the vector correctly but forgets to change the y-coordinate at all gets (10.5, 3).
15. (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.
16. (c) 46 — Method: the cumulative frequency table gives the number of runners below each time; to find the number at or above a time, subtract that cumulative frequency from the total. Working: the cumulative frequency for t < 40 is 74, so 120 runners in total take away the 74 who finished in under 40 minutes: 120 − 74 = 46. Answer: 46 runners took 40 minutes or longer. Watch which boundary and which subtraction you use: reading off t < 50 instead of t < 40 and subtracting, 120 − 110 = 10, answers a different question, '50 minutes or longer'; giving 74 itself as the answer reports how many finished below 40 minutes, the opposite of what was asked; and subtracting the two nearby cumulative frequencies, 110 − 74 = 36, finds how many took between 40 and 50 minutes, not everyone from 40 minutes upward.
17. (a) −1 — Reflecting y = sin x in the x-axis gives y = −sin x, so g(x) = −sin x. Since sin 90° = 1, g(90) = −1. Reading sin 90° = 1 and forgetting to apply the reflection gives 1. Misreading the angle as 0° instead of 90° gives sin 0° = 0, so 0. Confusing sin 90° with sin 30° = 0.5, then reflecting it, gives −0.5.
18. (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.