🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (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.
2. (b) 12/19 — Method: turn the percentages into expected frequencies out of 1000, total the faulty pens, then divide supplier Y's faulty pens by that total, because the pen picked is known to be faulty. Working: supplier X provided 700 pens and 2% of them are faulty, which is 14 pens. Supplier Y provided 300 pens and 8% of them are faulty, which is 24 pens. Altogether 38 pens are faulty, so the probability is 24/38, and dividing the numerator and the denominator by 2 gives 12/19. Answer: the probability is 12/19. The distractors: 3/10 is supplier Y's share of the stock, the answer before the faulty information is used at all; 3/125 is 24/1000, the probability that a pen is from supplier Y and faulty, which stops at the joint probability and never divides by the probability of a fault; 4/5 is 8 divided by 2 + 8, comparing the two fault rates as though the suppliers provided equal numbers of pens, so the 70 to 30 split is thrown away.
3. (a) (2n + 1) + (2n + 3) = 4n + 4 = 4(n + 1) — Two consecutive odd numbers can be written as 2n + 1 and 2n + 3, for a whole number n. Adding them: (2n + 1) + (2n + 3) = 4n + 4 = 4(n + 1), which is a multiple of 4 for every whole number n, proving the general result. Using 2n + 1 twice does not represent two different numbers, so it proves nothing about a sum of two numbers; writing n + (n + 2) drops the +1 that makes the numbers odd in the first place, and only shows a multiple of 2; and check every constant term is added correctly — 1 + 3 is 4, not 3.
4. (b) (12, −9) — Two enlargements one after the other combine into a single scale factor: 1.5 × 2 = 3. Multiplying a vector by a scalar means multiplying both the top number and the bottom number by it: top = 4 × 3 = 12, bottom = −3 × 3 = −9, giving (12, −9). A candidate who adds the scale factor to each number instead of multiplying gets (4 + 3, −3 + 3) = (7, 0). A candidate who multiplies the top number but leaves the bottom number unchanged gets (12, −3). A candidate who multiplies the bottom number but leaves the top number unchanged gets (4, −9). The correct column vector for the poster is (12, −9).
5. (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.
6. (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.
7. (b) 60 — Method: independence means the proportion of part timers among the cyclists is the same as the proportion among all the employees, so find that proportion and apply it to the cyclists. Working: 150 of the 400 employees work part time, which is a proportion of 0.375. Applying it to the 160 cyclists gives 0.375 × 160 = 60 employees. Answer: you would expect 60 employees. The distractors: 310 adds 150 and 160, treating the group who do both as everyone who does one thing or the other; 10 subtracts 150 from 160, reading 'both' as the difference between the two counts; 75 halves the 150 part timers, assuming that independence means they split evenly between cyclists and non cyclists, which would need exactly half the workforce to cycle.
8. (c) 37.5 — The tangent at (18, 24) is 18x + 24y = 900 (using ax + by = r² with a = 18, b = 24, r² = 900). Setting x = 0 to find the y-intercept: 24y = 900, so y = 37.5. Choosing 900 skips the division by 24 and just repeats the constant. Choosing 50 divides the constant by the x-coefficient 18 instead of the y-coefficient 24. Choosing 1.25 uses the radius 30 instead of r² = 900 as the constant before dividing.
9. (a) (8, 2) — Method: translating a point by a column vector means adding the vector's top number to the x-coordinate and its bottom number to the y-coordinate. Working: x-coordinate 2 + 6 = 8; y-coordinate 5 + (−3) = 2. Answer: B = (8, 2). A candidate who ignores the negative sign and adds 3 instead of −3 gets (8, 8). A candidate who translates in the reverse direction, subtracting the vector from A instead of adding it, gets (−4, 8). A candidate who swaps the vector's top and bottom numbers before adding gets (−1, 11).
10. (b) (3, −3) — Subtracting column vectors means subtracting the top numbers and subtracting the bottom numbers, in the order given: top = 5 − 2 = 3, bottom = 1 − 4 = −3, giving (3, −3). A candidate who works out v − u instead of u − v, reversing the order, gets (−3, 3). A candidate who makes a sign error on the bottom number, treating 1 − 4 as 3 instead of −3, gets (3, 3). A candidate who adds the vectors instead of subtracting gets (7, 5). Because the question asks for u − v, not v − u, the correct answer is (3, −3).
11. (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.
12. (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.
13. (b) (6, −8) — Method: a scalar multiple of m has the same ratio between its top and bottom numbers as m does. Working: m = (3, −4); multiplying both parts by 2 gives 2 × 3 = 6 and 2 × (−4) = −8, so (6, −8) is a scalar multiple of m. Answer: (6, −8). The vector (6, −4) needs a multiplier of 2 for the top number but only 1 for the bottom number, so it is not a multiple. The vector (−6, −8) needs a multiplier of −2 for the top number but 2 for the bottom number, so it is not a multiple. The vector (9, −8) needs a multiplier of 3 for the top number but 2 for the bottom number, so it is not a multiple.
14. (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.
15. (a) 2x − 1 — Swap x and y: x = (y + 1)/2. Multiply both sides by 2: 2x = y + 1. Subtract 1 from both sides: y = 2x − 1, so f⁻¹(x) = 2x − 1. Writing 2x + 1 comes from not flipping the sign on the 1 when it is moved across the equals sign. Writing (x − 1)/2 comes from reversing the sign of the 1 but leaving the ÷2 from the original rule in place, instead of turning it into ×2. Writing x/2 − 1 comes from dividing only the x by 2 and treating the 1 as already outside the fraction.
16. (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.
17. (b) 5.00 — Continuing the iteration: x₁ = √(2 × 1 + 15) = √17 = 4.1231, x₂ = √(2 × 4.1231 + 15) = √23.2462 = 4.8214, x₃ = √(2 × 4.8214 + 15) = √24.6428 = 4.9642, x₄ = √(2 × 4.9642 + 15) = √24.9284 = 4.9928, and the values keep climbing towards 5.00 as n increases (the limit L satisfies L² = 2L + 15, so L² − 2L − 15 = 0, giving L = 5). Choosing 4.99 stops after x₄, one iteration before the value has settled fully to 5.00. Choosing 17.00 uses the value under the very first square root (2 × 1 + 15 = 17) as if that number itself were the limit. Choosing 1.00 assumes the sequence never moves from the starting value x₀.
18. (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.