🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (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.
2. (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.
3. (a) 1.861 — x₁ = ∛(10 − 2²) = ∛6 = 1.817120593. x₂ = ∛(10 − 1.817120593²) = ∛6.698072751 = 1.885022855. x₃ = ∛(10 − 1.885022855²) = ∛6.446688837 = 1.861139399, which rounds to 1.861. Reporting x₂ instead of x₃ gives 1.885022855, which rounds to 1.885. Stopping after the first iteration and reporting x₁ instead of x₃ gives 1.817120593, which rounds to 1.817. A sign error inside the cube root, using xₙ₊₁ = ∛(10 + xₙ²) instead of ∛(10 − xₙ²), gives x₁ = ∛14 = 2.410142264, x₂ = ∛(10 + 2.410142264²) = 2.509763724, and x₃ = ∛(10 + 2.509763724²) = 2.535437381, which rounds to 2.535.
4. (b) 0.355 — Method: use the law of total probability across the two Monday branches: P(rain Tue) = P(rain Mon) × P(rain Tue | rain Mon) + P(no rain Mon) × P(rain Tue | no rain Mon). Working: P(no rain Mon) = 1 − 0.3 = 0.7. P(rain Tue) = (0.3 × 0.6) + (0.7 × 0.25) = 0.18 + 0.175 = 0.355. Answer: 0.355. Watch out: using only the rain-Monday branch (0.3 × 0.6) or only the no-rain-Monday branch (0.7 × 0.25) accounts for just one of the two ways Tuesday can turn out rainy — both branches must be added. And swapping which weekday-probability multiplies which branch (0.7 with the rain branch, 0.3 with the no-rain branch) uses the right numbers on the wrong branches.
5. (a) 4/9 — Method: two steps. Find how many cars failed altogether, because the car picked is known to be one of them, then divide the diesel failures by that total. Working: 30 petrol cars and 24 diesel cars failed, so 54 cars failed. The diesel failures give 24/54, and dividing the numerator and the denominator by 6 gives 4/9. Answer: the probability is 4/9. The distractors: 3/10 is 24/80, the probability that a car fails given that it is a diesel car, which is the condition and the event swapped; 3/25 is 24/200, dividing by every car serviced that week rather than by the 54 that failed; 2/5 is 80/200, the probability that a car chosen from the whole week is a diesel car, which ignores the fact that the car picked failed.
6. (c) 4.30 — Method: substitute the starting value into the right-hand side to get x₁, then feed each value back in, keeping the whole display and respecting the order of operations, which divides before it subtracts. Working: x₁ = 5 − 3 ÷ 2.5 = 5 − 1.2 = 3.8; x₂ = 5 − 3 ÷ 3.8 = 5 − 0.78947… = 4.21052…; x₃ = 5 − 3 ÷ 4.21052… = 5 − 0.7125 = 4.2875; x₄ = 5 − 3 ÷ 4.2875 = 5 − 0.69970… = 4.30029…, which is 4.30 correct to 3 significant figures. Answer: 4.30. The distractors: 4.29 is x₃ = 4.2875 rounded, reached by counting the starting value itself as the first iterate and so stopping one use of the formula early; 3.80 is x₁, the value after a single use of the formula; 2.50 comes from working out (5 − 3) ÷ xₙ instead of 5 − (3 ÷ xₙ), subtracting before dividing, which produces the sequence 0.8, 2.5, 0.8, 2.5 and lands on 2.5 at the fourth step.
7. (d) 2/3 — Method: since A is the midpoint of OE, OE = 2a, so E = 2a. Since FB is twice AF, F is 1/3 of the way along AB from A, so F = a + 1/3(b − a) = (2/3)a + (1/3)b. G is the midpoint of OB, so G = (1/2)b. Working: EF = F − E = (2/3)a + (1/3)b − 2a = −(4/3)a + (1/3)b, and EG = G − E = −2a + (1/2)b. Comparing term by term, 2/3 × (−2a + (1/2)b) = −(4/3)a + (1/3)b, which matches EF exactly — the same scalar works on both the a-term and the b-term, so the two vectors are parallel, and since they share the point E the three points are collinear. Answer: k = 2/3, so E, F and G lie on a straight line. Giving 1/3 instead is the scalar linking F to G (FG = (1/3)EG), not E to F; giving 3/2 is the reciprocal — it is EG that equals 3/2 × EF, not the other way round, since EF = k × EG was what was asked for; and giving 4/3 is EF's a-coefficient read off raw, without ever dividing it by EG's a-coefficient to form the comparison. Always match the direction of the scalar to the vectors exactly as the question states them.
8. (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.
9. (d) 4, 3, 2, 6 — Method: frequency density = frequency ÷ class width for each class in turn; do not assume the classes are all the same width. Working: the four classes have widths 10 − 0 = 10, 30 − 10 = 20, 45 − 30 = 15 and 50 − 45 = 5. Dividing each frequency by its own width gives 40 ÷ 10 = 4, 60 ÷ 20 = 3, 30 ÷ 15 = 2 and 30 ÷ 5 = 6. Answer: the frequency densities, in order, are 4, 3, 2 and 6. Watch the width of each class separately: treating the last class as if it were also 10 units wide, like the first, gives 30 ÷ 10 = 3 instead of 30 ÷ 5 = 6 — the classes here are deliberately unequal, so no width can be borrowed from another class; dividing the width by the frequency instead of the frequency by the width for the third class gives 15 ÷ 30 = 0.5 in place of 2, the formula the wrong way round; and reading the frequency column straight off the table, 40, 60, 30, 30, skips the division by width altogether and reports how many fish are in each class rather than how densely packed each bar is.
10. (b) y = 2x − 1 — Method: in a rule that multiplies and then adds, the multiplier is the step in the outputs for each step of 1 in the input, and the number added on is the output when the input is 0. Working: the inputs 0, 1, 2 rise in ones while the outputs −1, 1, 3 rise by 2 each time, so the input is multiplied by 2; an input of 0 gives 2 × 0 = 0 and the output must be −1, so 1 is subtracted. Answer: y = 2x − 1, checked against the last pair by 2 × 2 − 1 = 3. The distractors: y = 2x + 1 comes from finding the multiplier 2 correctly and then reading the output at an input of 0 as +1 instead of −1; y = x − 1 comes from taking the multiplier as 1 because the inputs go up in ones, instead of using the step in the outputs; y = 3x − 1 comes from reading the largest output, 3, as the multiplier.
11. (c) Translate +1 in y; new range 0 ≤ y ≤ 2 — Adding 1 to sin x translates the graph 1 unit in the positive y-direction, and every y-value on the range increases by 1: −1 + 1 = 0 and 1 + 1 = 2, giving a new range of 0 ≤ y ≤ 2. A translation in the x-direction would not add anything to the y-values, so 'Translate +1 in x; range unchanged' correctly leaves the range at −1 ≤ y ≤ 1 for that (wrong) transformation, but the transformation itself is not what y = sin x + 1 shows. 'Translate +1 in y; new range −2 ≤ y ≤ 0' correctly spots the translation but subtracts 1 from each bound instead of adding it. 'Reflect in the x-axis' mistakes the transformation for a reflection rather than a translation; reflecting sin x in the x-axis does leave the range at −1 ≤ y ≤ 1 unchanged in size, but that is not the transformation y = sin x + 1 actually applies.
12. (d) −2 — y = f(x) − 6 is f(x) shifted down by 6, so every y-value on the graph decreases by 6. At x = 0, f(0) = 4, so the new y-value is 4 − 6 = −2. Adding 6 instead of subtracting gives 10; writing down the shift itself, −6, or leaving the original value 4 unchanged both skip the translation altogether.
13. (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₀.
14. (c) −1.5 — Since n = k × m, dividing a number in n by the matching number in m gives k: k = −6 ÷ 4 = −1.5 (check with the bottom numbers: −9 ÷ 6 = −1.5, the same value, confirming n is a scalar multiple of m). 1.5 has the correct size but is missing the negative sign. −10 comes from subtracting the top numbers, −6 − 4, instead of dividing them. −24 comes from multiplying the top numbers, −6 × 4, instead of dividing them.
15. (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.
16. (d) 18 minutes — Method: the lower quartile is the 80 ÷ 4 = 20th value and the upper quartile is the 3 × 80 ÷ 4 = 60th value; locate each inside its class by linear interpolation, then subtract. Working: the 20th value lies between the running totals 8 and 28, so it is in the class 10 ≤ t < 20, which holds 20 journeys across 10 minutes, and it is the 20 − 8 = 12th of them, giving 10 + (12 ÷ 20) × 10 = 16 minutes; the 60th value lies between the running totals 52 and 72, so it is in the class 30 ≤ t < 40, which also holds 20 journeys across 10 minutes, and it is the 60 − 52 = 8th of them, giving 30 + (8 ÷ 20) × 10 = 34 minutes; subtracting, 34 − 16 = 18. Answer: an estimated interquartile range of 18 minutes. The distractors: 20 minutes comes from taking the lower boundaries of the two quartile classes, 30 − 10, which locates the classes but never the values inside them; 40 minutes comes from subtracting the two positions, 60 − 20, instead of the two times; 22 minutes comes from interpolating downwards from each upper boundary rather than upwards from each lower boundary, giving 20 − 6 = 14 and 40 − 4 = 36.
17. (a) Positive x-direction, 90°; image is y = sin x. — Writing cos(x − 90°) as cos(x − a) with a = 90 shows this is a horizontal translation, y = f(x − a), which moves the graph 90° in the positive x-direction; the identity cos(x − 90°) = sin x confirms the image is y = sin x. Choosing the negative x-direction reverses the sign inside the bracket — subtracting inside the bracket always translates in the positive x-direction, not the negative one, so that statement is wrong on direction. Getting the direction right but conflating the subtraction inside the bracket with an extra reflection of the output flips the sign of the resulting graph, wrongly giving y = −sin x. Treating the subtraction as if it changed the output directly, rather than the input, wrongly calls this a vertical translation even while still correctly recalling that the image simplifies to y = sin x.
18. (a) −3/4 — Method: the tangent at a point on a circle is perpendicular to the radius drawn to that point, so find the gradient of the radius and then take its negative reciprocal. Working: the radius joins (0, 0) to (6, 8), so its gradient is 8 ÷ 6, which cancels to 4/3. Turning 4/3 upside down gives 3/4, and changing the sign gives −3/4. Answer: the gradient of the tangent is −3/4. The distractors: 4/3 is the gradient of the radius itself, quoted without taking the perpendicular at all; −4/3 changes the sign but leaves the fraction the same way up, so the two gradients do not multiply to give −1; 3/4 turns the fraction upside down but keeps it positive, which is the other half of the same rule left undone.