🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (c) 27 — Method: a frequency is the area of the part of the bar being asked about, so frequency = frequency density × the width of that part. Working: the part asked about runs from 20 to 35, so its width is 35 − 20 = 15 metres; the frequency density there is 1.8 per metre, so the estimate is 1.8 × 15 = 27. Answer: about 27 throws. The distractors: 72 comes from taking the whole bar, 1.8 × 40, and so counting every throw from 20 up to 60; 1.8 comes from reading the height of the bar as a frequency, when a height is a density and only an area is a count; 63 comes from using the upper value 35 as the width, 1.8 × 35, instead of the width 35 − 20.
2. (c) 1/2 — Method: restrict to the students who did NOT bring a packed lunch, then find what fraction of that group are girls. Girls without lunch = 42 − 24 = 18. Boys = 70 − 42 = 28, so boys without lunch = 28 − 10 = 18. Total without lunch = 18 + 18 = 36. Working: P(girl | no lunch) = 18 ÷ 36 = 1/2. Answer: 1/2. Watch out: dividing 18 by 42 (the total number of girls) instead of by 36 finds P(no lunch | girl), the reverse conditional. Dividing by 70 (the whole trip) ignores that you already know the student did not bring a lunch. And using the 'brought a lunch' numbers (24 out of 34) answers the question for the wrong group entirely — you were asked about the students who did NOT bring one.
3. (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).
4. (d) x = 4 and x = −4 — Substituting y = 3 gives x² + 9 = 25, which simplifies to x² = 16, so x = 4 or x = −4. Choosing 'x = 3 and x = −3' uses the given value y = 3 as if it were the x-coordinate. Choosing 'x = 4' alone finds the positive square root of 16 but forgets the negative root. Choosing 'x = 5 and x = −5' skips subtracting 3² = 9 from 25 and takes the square root of 25 directly.
5. (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.
6. (a) 4.897 — Method: substitute the starting value into the right-hand side of the formula to get x₁, then feed each new value back in, keeping the whole calculator display every time and rounding only at the very end. Working: x₁ = √(5 × 2 + 2) = √12 = 3.46410…; x₂ = √(5 × 3.46410… + 2) = √19.32050… = 4.39551…; x₃ = √(5 × 4.39551… + 2) = √23.97755… = 4.89668…, which is 4.897 correct to 3 decimal places. Answer: 4.897. The distractors: 4.396 is x₂, written down by a candidate who counts the starting value x₀ as the first iterate and so stops one use of the formula early; 3.464 is x₁, the value after using the formula only once; 5.146 is x₄, one use of the formula too many — the mirror image of the first slip, made by a candidate who labels the first value worked out as x₀ rather than as x₁ and so runs the count a step long.
7. (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.
8. (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.
9. (a) 19 — Each time x increases by 1, y increases by 3 (4, 7, 10, 13 — a constant difference of 3). So at x = 4, y = 13 + 3 = 16, and at x = 5, y = 16 + 3 = 19. A candidate who stops one step early, giving the value for x = 4 instead of x = 5, answers 16. A candidate who overcounts and adds three steps of 3 instead of two from x = 3 gets 13 + 9 = 22. A candidate who mistakes the y-intercept (4) for the common difference and adds 4 twice from x = 3 gets 13 + 8 = 21.
10. (b) 5 ≤ m < 10 — Method: with 60 values the median is the 60 ÷ 2 = 30th value in order, so build a running total until it first reaches 30. Working: the running totals are 22 after the first class, 22 + 20 = 42 after the second, 51 after the third, 56 after the fourth and 60 after the fifth; the 30th parcel is past 22 but not past 42, so it lies in the second class. Answer: the median lies in the class 5 ≤ m < 10. The distractors: 0 ≤ m < 5 comes from giving the class with the greatest frequency, 22, which is the modal class and not the median class; 10 ≤ m < 20 comes from choosing the middle class in the list of five instead of counting to the middle value; 20 ≤ m < 30 comes from halving the range of the data, 50 ÷ 2 = 25, and giving the class that contains 25 kg rather than the class that contains the 30th parcel.
11. (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.
12. (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.
13. (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.
14. (b) 2x + 3 — fg(x) means f(g(x)): apply g first, then apply f to the result. g(x) = 2x, so f(g(x)) = f(2x) = 2x + 3. Writing 2x + 6 comes from working out gf(x) instead — g(f(x)) = g(x + 3) = 2(x + 3) = 2x + 6 — which applies the functions in the wrong order. Writing 3x + 3 comes from adding f(x) and g(x) together, (x + 3) + 2x = 3x + 3, instead of composing them. Writing 2x² + 6x comes from multiplying f(x) and g(x) together, (x + 3)(2x) = 2x² + 6x, instead of substituting one into the other.
15. (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.
16. (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.
17. (c) xₙ₊₁ = ∛(9 − 4xₙ) — Method: a formula xₙ₊₁ = f(xₙ) is a correct rearrangement when the equation x = f(x) turns back into the equation you started with, so rearrange x³ + 4x − 9 = 0 by making the cube the subject. Working: x³ + 4x − 9 = 0 gives x³ = 9 − 4x, because the 4x and the 9 each change sign as they cross the equals sign; taking the cube root of both sides gives x = ∛(9 − 4x), which is the formula xₙ₊₁ = ∛(9 − 4xₙ). Answer: xₙ₊₁ = ∛(9 − 4xₙ). The distractors: ∛(9 + 4xₙ) comes from writing x³ = 9 + 4x, moving the 4x across the equals sign without changing its sign; (9 + xₙ³)/4 comes from making the linear term the subject but keeping the sign of the cube, writing 4x = 9 + x³ when the equation gives 4x = 9 − x³; ∛(9 − 4xₙ³) cubes the x in the linear term as well, changing a term the original equation never cubed.
18. (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.