🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (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.
2. (d) 2x² − 4x + 3 — fg(x) means f(g(x)): substitute g(x) into f in place of x. g(x) = x − 1, so fg(x) = f(x − 1) = 2(x − 1)² + 1. Expanding (x − 1)² = x² − 2x + 1, so fg(x) = 2(x² − 2x + 1) + 1 = 2x² − 4x + 2 + 1 = 2x² − 4x + 3. Writing 2x² comes from working out gf(x) instead — g(f(x)) = f(x) − 1 = (2x² + 1) − 1 = 2x², which applies the functions in the wrong order. Writing 2x² − 1 comes from expanding (x − 1)² as x² − 1, dropping the middle term, so f(x − 1) becomes 2(x² − 1) + 1 = 2x² − 2 + 1 = 2x² − 1. Writing 2x² − 4x + 2 comes from expanding correctly but forgetting the final + 1 from f, stopping at 2(x² − 2x + 1) = 2x² − 4x + 2.
3. (d) y = −f(x + 2) has a maximum turning point at (1, 5). — y = f(x + 2) translates the graph 2 units in the negative x-direction, so the turning point's x-coordinate moves from 3 to 1; reflecting in the x-axis then negates the y-coordinate, turning −5 into 5, and also turns a minimum into a maximum — giving a true maximum turning point at (1, 5). Translating the root at x = 1 in the wrong direction, adding 2 instead of subtracting it, gives x = 3, but the true image root is at 1 − 2 = −1, so that statement is false. Keeping the coordinates (1, 5) correct but forgetting that reflecting in the x-axis turns a minimum into a maximum gives a false "minimum turning point" statement. Getting the reflection's effect on the turning-point type right (a maximum) but translating the x-coordinate in the wrong direction, using 3 + 2 = 5 instead of 3 − 2 = 1, gives a false statement at (5, 5).
4. (a) y = (4/3)x + 25/3 — The radius from (0, 0) to (−4, 3) has gradient 3 ÷ (−4) = −3/4. The tangent is perpendicular to the radius, so its gradient is the negative reciprocal, 4/3. Using y − y₁ = m(x − x₁) with the point (−4, 3): y − 3 = (4/3)(x + 4), so y = (4/3)x + 16/3 + 3 = (4/3)x + 25/3. Using the radius's own gradient, −3/4, instead of taking the perpendicular gradient, gives y − 3 = (−3/4)(x + 4), which simplifies to y = −(3/4)x once the −3 and +3 in the constant cancel out. Taking the reciprocal of the radius's gradient but keeping the wrong sign, using −4/3 instead of 4/3, gives y = −(4/3)x − 7/3. Correctly finding the gradient 4/3 and expanding the bracket, but forgetting to add the y-coordinate 3 at the end, gives y = (4/3)x + 16/3.
5. (c) 15/23 — Method: find P(rough and delayed) and the overall P(delayed) using the tree, then divide. Working: P(rough and delayed) = 0.2 × 0.75 = 0.15. P(calm and delayed) = 0.8 × 0.1 = 0.08. P(delayed) = 0.15 + 0.08 = 0.23. P(rough | delayed) = 0.15 ÷ 0.23 = 15/23. Answer: 15/23. Watch out: leaving the answer as 0.15 (3/20) gives P(rough and delayed) itself, without dividing by the overall probability that a crossing is delayed. Giving 0.75 (3/4) is the probability you were told to start with — that a crossing is delayed GIVEN the sea is rough — which is the reverse of what's being asked. And 0.2 (1/5) is just the original probability that the sea is rough, before you take the fact that the crossing was delayed into account.
6. (b) 12n — Distributing the minus sign across the second bracket gives n² + 6n + 9 − n² + 6n − 9, and the n² terms and the +9/−9 cancel, leaving 6n + 6n = 12n. Writing 18 comes from only negating the first term of the second bracket, n², and treating the −6n and +9 as unchanged, which gives n² + 6n + 9 − n² − 6n + 9 = 18. Writing 2n² + 18 comes from adding the two brackets instead of subtracting them, (n² + 6n + 9) + (n² − 6n + 9) = 2n² + 18. Writing 6n comes from correctly negating the bracket but then only counting one of the two 6n terms, missing that they add rather than cancel.
7. (d) line 2 — Line 1 correctly represents three consecutive integers using n. Line 2 adds them: n + (n + 1) + (n + 2). Collecting terms: the n-terms give 3n, and the constants give 1 + 2 = 3, so the correct sum is 3n + 3, not 3n + 2 as Line 2 states — this is the first error, an arithmetic slip in collecting the constant terms. Lines 3 and 4 both follow correctly from Line 2's incorrect result, but that result itself is wrong: the true sum, 3n + 3 = 3(n + 1), is a multiple of 3 for every whole number n. Check the working of each line against what came before it, in order, rather than judging whether the final conclusion feels right — an error that flips the conclusion can sit several lines before the line that states it.
8. (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.
9. (a) 1.6 — Method: on a histogram the height of a bar is the frequency density, and frequency density = frequency ÷ class width. Working: the class 15 ≤ t < 30 runs from 15 to 30, so its width is 30 − 15 = 15 minutes; the frequency is 24, so the frequency density is 24 ÷ 15 = 1.6. Answer: 1.6 people per minute. The distractors: 360 comes from multiplying the frequency by the class width, 24 × 15, which uses the area rule backwards — area gives the frequency, so the frequency must be divided by the width to give the height; 0.625 comes from dividing the class width by the frequency, 15 ÷ 24, reversing the formula; 0.8 comes from dividing by the upper class boundary, 24 ÷ 30, instead of by the width of the class.
10. (d) 36/91 — Method: P(both red | same colour) = P(both red) ÷ P(same colour), where P(same colour) = P(both red) + P(both green). Working: P(both red) = 9/20 × 8/19 = 72/380 = 18/95. P(both green) = 11/20 × 10/19 = 110/380 = 11/38. P(same colour) = 18/95 + 11/38 = 36/190 + 55/190 = 91/190. P(both red | same colour) = (36/190) ÷ (91/190) = 36/91. Answer: 36/91. Watch out: stopping at 18/95 gives P(both red) itself, without dividing by the probability that the colours matched at all. Working out 55/91 finds the same-colour probability for green instead of red — check which colour's count you are putting on top. And 9/20 is just the chance the first ball drawn is red, which ignores the second draw and the without-replacement condition completely.
11. (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.
12. (b) (1/2)b − (1/2)a — Method: MN runs from M to N, so MN = ON − OM, with OM = (1/2)a and ON = (1/2)b. Working: MN = (1/2)b − (1/2)a. Answer: MN = (1/2)b − (1/2)a. Subtracting the other way round gives (1/2)a − (1/2)b, the reverse vector from N to M; subtracting the wrong way round AND forgetting to halve gives a − b, which is BA, not MN; and adding the two halved vectors instead of subtracting them gives (1/2)a + (1/2)b, which is the position vector of the midpoint of AB. Always subtract the START point's vector from the END point's vector, and halve OA and OB before you combine them, not after.
13. (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.
14. (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.
15. (b) (x + 2)/3 — Start with y = 3x − 2 and swap x and y: x = 3y − 2. Add 2 to both sides: x + 2 = 3y. Divide both sides by 3: y = (x + 2)/3, so f⁻¹(x) = (x + 2)/3. Writing x/3 + 2 comes from dividing only the 3y term by 3 and leaving the +2 outside the division — the 2 must be added before you divide, not after. Writing (x − 2)/3 comes from keeping the subtraction sign instead of flipping it to addition when the −2 is moved across the equals sign. Writing 3x + 2 comes from swapping x and y but never actually solving for y — just changing the sign of the constant term.
16. (d) Yes, because 3² + 4² = 25. — A point lies on the circle x² + y² = 25 exactly when substituting its coordinates makes the equation true. Squaring each coordinate separately and adding: 3² + 4² = 9 + 16 = 25, which matches the right-hand side, so (3, 4) does lie on the circle. Adding the coordinates without squaring them, 3 + 4 = 7, and then reasoning that 7 is less than 25 happens to reach the same verdict, but it is not testing the equation of the circle at all — the circle equation depends on x² + y², not x + y. Squaring the sum instead of summing the squares, (3 + 4)² = 49, not 25, wrongly rules the point out. Doubling each coordinate instead of squaring it, so that 4² is taken as 8, gives 9 + 8 = 17, not 25, which also wrongly rules the point out.
17. (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.
18. (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.