🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (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.
2. (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.
3. (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).
4. (a) They always charge the same, since 3(2n + 4) = 6n + 12. — Expand Advert A's formula by multiplying both terms inside the bracket by 3: 3 × 2n = 6n, and 3 × 4 = 12, giving 3(2n + 4) = 6n + 12, which is identical to Advert B's formula — so the two adverts always charge the same amount, whatever n is. Getting 6n + 4 comes from multiplying the 2n by 3 but leaving the 4 unmultiplied. Getting 2n + 7 comes from adding 3 to the bracket instead of multiplying by it. Saying it depends on n avoids expanding the bracket at all — once expanded, both formulas are identical for every value of n, so the cost can be compared directly.
5. (c) 20 ≤ h < 40 — Method: with 80 values the lower quartile is the 80 ÷ 4 = 20th value in order, so build a running total until it first reaches 20. Working: the running totals are 14, then 14 + 22 = 36, then 52, then 80; the 20th plant is past 14 but not past 36, so it lies in the second class. Answer: the lower quartile lies in the class 20 ≤ h < 40. The distractors: 0 ≤ h < 20 comes from believing that the bottom quarter of the data must all sit in the first class, when that class holds only 14 of the 80 plants; 40 ≤ h < 50 comes from using the position 80 ÷ 2 = 40 and so locating the median rather than the lower quartile; 50 ≤ h < 80 comes from counting 20 plants down from the tallest instead of up from the shortest, which locates the upper quartile at the 60th plant.
6. (b) x² + y² = 81 — The equation of a circle with centre the origin and radius r is x² + y² = r². Here r = 9, so r² = 9 × 9 = 81, giving x² + y² = 81. Choosing x² + y² = 9 uses the radius itself instead of squaring it. Choosing x² + y² = 18 doubles the radius (9 × 2 = 18) instead of squaring it. Choosing x² − y² = 81 keeps the correct 81 but writes a minus instead of a plus, which is not the equation of a circle.
7. (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.
8. (d) 25 ≤ t < 45 — Method: the height of a bar on a histogram is the frequency density, so work out frequency ÷ class width for every class and compare the four heights. Working: 20 ÷ 10 = 2 for the first class; 12 ÷ 15 = 0.8 for the second; 50 ÷ 20 = 2.5 for the third; 60 ÷ 30 = 2 for the fourth. Answer: the largest of 2, 0.8, 2.5 and 2 is 2.5, so the tallest bar is the one for 25 ≤ t < 45. The distractors: 45 ≤ t < 75 comes from picking the class with the greatest frequency, 60, and treating a frequency as a height — but that class is three times as wide, so its 60 competitors are spread thinly; 10 ≤ t < 25 comes from dividing the class width by the frequency, 15 ÷ 12, and picking the largest of those reversed values; 0 ≤ t < 10 comes from assuming the narrowest class must always give the tallest bar, which is only true when the frequencies are equal.
9. (a) 70 — Method: two linked steps. Find the expected number of billing calls first, then take the 35% of those, because the 35% is quoted for billing calls only. Working: 40% of 500 is 200 billing calls. 35% of 200 is 70 calls. Answer: you would expect 70 calls. The distractors: 200 stops after the first step and gives the billing calls, forgetting that only some of them are dealt with quickly; 175 is 35% of 500, applying the quick response rate to every call the centre takes rather than to the billing calls only; 375 comes from adding 40% and 35% to get 75% and taking 75% of 500, which treats two stages of one journey as separate outcomes to be added.
10. (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.
11. (a) 49 — Method: add the frequencies of the classes that lie wholly below 35 seconds, then use linear interpolation for the class that 35 cuts through, assuming the calls in that class are spread evenly across it. Working: below 30 seconds there are 15 + 24 = 39 calls; the value 35 lies in the class 30 ≤ t < 50, which is 20 seconds wide and holds 40 calls, and 35 is 35 − 30 = 5 seconds into it, so the estimated share is (5 ÷ 20) × 40 = 10 calls; the estimate is 39 + 10 = 49. Answer: about 49 calls met the target. The distractors: 79 comes from adding the whole of the class 30 ≤ t < 50, 39 + 40, and so counting calls of up to 50 seconds as being under 35; 39 comes from stopping at the class boundary 30 and ignoring the part class altogether; 69 comes from measuring the part of the class from 35 up to 50 instead of from 30 up to 35, giving (15 ÷ 20) × 40 = 30 and then 39 + 30.
12. (c) 10x − 15 — Expand the bracket first: 3(2x − 5) = 6x − 15. Then add the 4x: 6x − 15 + 4x = 10x − 15. The option 10x − 5 comes from forgetting to multiply the 5 inside the bracket by 3 (treating it as 6x − 5), then adding 4x. The option 10x + 15 comes from a sign error when expanding, treating 3 × (−5) as +15 instead of −15, then adding 4x. The option 6x − 15 comes from expanding the bracket correctly but forgetting to add the 4x term at all.
13. (d) y = −2x + 10 — Method: a tangent is perpendicular to the radius drawn to the point where it touches, so work out the gradient of that radius, take its negative reciprocal for the tangent, then substitute into y − y₁ = m(x − x₁). Working: the radius joins (0, 0) to (4, 2), so its gradient is 2 ÷ 4 = 1/2; turning 1/2 upside down gives 2 and changing the sign gives −2. Substituting into y − 2 = −2(x − 4) gives y − 2 = −2x + 8, so y = −2x + 10. Answer: y = −2x + 10. The distractors: y = −0.5x + 4 changes the sign of the radius gradient but never turns it upside down, using −1/2 where −2 belongs; y = 2x − 6 turns the gradient upside down but leaves it positive, using 2 where −2 belongs; y = −2x − 10 has the correct gradient but substitutes the point with both signs reversed, writing y + 2 = −2(x + 4) instead of y − 2 = −2(x − 4).
14. (a) y = −2x + 3 — Method: find the step in the outputs for each step of 1 in the input — falling outputs mean a negative multiplier — then read off the output when the input is 0, because that is the number added on. Working: the outputs 5, 3, 1, −1 fall by 2 each time x rises by 1, so x is multiplied by −2; the output at x = 0 is 3, so 3 is added. Answer: y = −2x + 3, checked at x = 2 by −2 × 2 + 3 = −1. The distractors: y = 2x + 3 comes from taking the size of the step, 2, as the multiplier and ignoring the fact that the outputs are falling; y = −2x − 3 comes from using the correct multiplier but writing the number added on as −3 instead of the output 3 listed at x = 0; y = −x + 4 comes from taking the multiplier as −1, its size read from the step of 1 in the inputs instead of the step of 2 in the outputs and its sign from the fact that the outputs fall, and then fitting the number added on to the pair x = −1, y = 5.
15. (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.
16. (b) 2/11 — Method: restrict the 36 equally likely outcomes to those where at least one die shows a 5, then find what fraction of THOSE give a total of 8. Working: outcomes with at least one 5: (5, 1), (5, 2), (5, 3), (5, 4), (5, 5), (5, 6), (1, 5), (2, 5), (3, 5), (4, 5), (6, 5) — 11 outcomes. Among these, the total is 8 for (5, 3) and (3, 5) — 2 outcomes. P(total 8 | at least one 5) = 2/11. Answer: 2/11. Watch out: 5/36 is P(total 8) over the full 36 outcomes — it ignores that you already know one die shows a 5. Treating the condition as 'the first die shows a 5' instead of 'at least one die shows a 5' restricts you to only 6 outcomes and misses the (3, 5) case, giving 1/6. And counting only (5, 3) but not its reverse (3, 5) inside the correct 11-outcome list gives 1/11 instead of 2/11.
17. (d) n and n + 1 are consecutive integers, so one of them must be even; this makes n(n + 1) even, so 4n(n + 1) is 4 × an even number, which is a multiple of 8. — The proof needs a reason why n(n + 1) is even, not just an assertion. n and n + 1 are consecutive integers, so exactly one of them is even; multiplying by that even number keeps n(n + 1) even, so 4n(n + 1) = 4 × (an even number), and 4 × an even number always has a further factor of 2 hidden inside it, making the whole product a multiple of 8. The option 'is a multiple of 4, and because n and n + 1 are consecutive integers, it must be a multiple of 8' asserts the multiple-of-8 conclusion directly from 'multiple of 4' and 'consecutive integers' without ever showing that n(n + 1) itself is even — the missing step is exactly what earns the mark. The option '4n is always a multiple of 4 ... which means it is a multiple of 8' mistakes 4n being a multiple of 4 for the whole product 4n(n + 1) being a multiple of 8; that extra factor of 2 only comes from n(n + 1) being even, not from 4n alone. The option that expands to 4n² + 4n and calls it 'clearly a multiple of 8' never checks for a factor of 2 beyond the 4 already there — the word 'clearly' is standing in for a missing argument.
18. (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.