🔺 Higher stretch — grade 8 and 9 topics

Answer key

1. (a) 4(x + 3) = 20 and 4x + 3 = 11 when x = 2, so the two expressions are not equivalent, because the bracket means the 3 must be added before multiplying by 4. — Substituting x = 2: 4(x + 3) = 4 × 5 = 20, and 4x + 3 = 8 + 3 = 11. The two values are different, and expanding 4(x + 3) algebraically gives 4x + 12, which can never equal 4x + 3 (that would require 12 = 3) — so the two expressions are never equivalent, for any value of x. The option claiming they become equal for a larger x is wrong: 4x + 12 = 4x + 3 has no solution at all. The option claiming they are equivalent because they share the terms 4x and 3 ignores that the bracket changes the constant term. The option that calculates 4(x + 3) as 11 ignores the bracket completely, applying the 4 only to the x term.
2. (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.
3. (a) 2.154 — Continuing xₙ₊₁ = ∛(3xₙ + 4) from x₁ = 2.154 gives x₂ = 2.187, x₃ = 2.195, settling towards the root near 2.196 — this is the formula that converges. Continuing xₙ₊₁ = (xₙ³ − 4) ÷ 3 from x₁ = 1.333 gives x₂ = −0.543 and then x₃ = −1.387, moving further from the root each time. Continuing xₙ₊₁ = 4 ÷ (xₙ² − 3) from x₁ = 4 gives x₂ = 0.308 and then x₃ = −1.377, swinging wildly rather than settling. Continuing xₙ₊₁ = xₙ³ − 2xₙ − 4 from x₁ = 0 gives x₂ = −4 and then x₃ = −60, running away from the root entirely.
4. (c) a + (1/2)c — Method: OABC is a parallelogram, so OB = OA + AB, and since AB is equal and parallel to OC, AB = c; this gives OB = a + c. M is the midpoint of AB, so AM = (1/2)AB = (1/2)c. Working: OM = OA + AM = a + (1/2)c. Answer: OM = a + (1/2)c. Adding the whole of AB instead of half of it gives a + c, which is OB, not OM; halving the whole diagonal OB instead of just AB gives (1/2)a + (1/2)c, the midpoint of OB rather than of AB; and flipping the sign on the c-term gives a − (1/2)c, which points back the wrong way along AB. Halve only the side you are told to halve, and check the sign before you commit to an answer.
5. (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).
6. (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.
7. (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.
8. (a) (4, 1) — y = −f(x) reflects the graph of y = f(x) in the x-axis: every point (x, y) maps to (x, −y). Applying this to (4, −1): the x-coordinate stays 4, and the y-coordinate −1 becomes its negative, 1. Leaving the y-coordinate unchanged skips the reflection entirely, giving (4, −1); reflecting the x-coordinate instead, or reflecting both, mixes this up with a reflection in the y-axis or a rotation, giving (−4, −1) or (−4, 1).
9. (b) 6 — Method: frequency density = frequency ÷ class width. Working: the class 12 ≤ h < 18 has width 18 − 12 = 6, so frequency density = 36 ÷ 6 = 6. Answer: the frequency density is 6 seedlings per cm. Watch which numbers you use: taking the lower bound, 12, as the width instead of 18 − 12 = 6 gives 36 ÷ 12 = 3; dividing the total number of seedlings, 90, rather than this class's frequency, 36, by the width gives 90 ÷ 6 = 15, a density that belongs to no single class; and multiplying instead of dividing gives 36 × 6 = 216, far too large a density for so narrow a class.
10. (b) x² + y² = 625 — Since (7, 24) lies on the circle, x² + y² = 7² + 24² = 49 + 576 = 625, so the equation is x² + y² = 625. Choosing x² + y² = 31 adds the coordinates 7 and 24 directly instead of squaring them first. Choosing x² + y² = 576 uses only 24² and forgets to add 7². Choosing x² + y² = 49 uses only 7² and forgets to add 24².
11. (d) 25 — Method: the median is estimated at position n ÷ 2 in the cumulative frequency table, then interpolated across the class it falls in: lower boundary, plus the fraction of the way through the class, times the class width. Working: there are 80 sacks, so the median sits at position 80 ÷ 2 = 40. Before the class 20 ≤ m < 30 the cumulative frequency is 22, and by the end of it, it is 58, so this class holds the 40th sack; its frequency is 58 − 22 = 36 and its width is 30 − 20 = 10. The extra distance needed into the class is 40 − 22 = 18, and 18 ÷ 36 × 10 = 5, so the median is 20 + 5 = 25. Answer: the estimated median mass is 25 kg. Watch which numbers the interpolation uses: reading off just the lower boundary of the median class, 20, ignores how far into that class the 40th sack actually falls; treating n ÷ 2 = 40 itself as the median mass mistakes a position in the list for a mass in kilograms; and using the target position, 40, as the extra distance into the class instead of subtracting the sacks already counted changes the calculation to 20 + 40 ÷ 36 × 10. That comes to 20 + 11.1 = 31.1, overshooting the class because it never subtracts the 22 sacks already counted before it.
12. (c) 145 g — Method: find the position of the median from the total frequency, locate the class that contains it, then use linear interpolation inside that class, assuming the apples in it are spread evenly. Working: the median is the 100 ÷ 2 = 50th apple; the running totals are 10, then 10 + 30 = 40, then 40 + 40 = 80, so the 50th apple lies in the class 140 ≤ m < 160; it is the 50 − 40 = 10th of the 40 apples in that class, and the class is 20 g wide, so the median is 140 + (10 ÷ 40) × 20 = 140 + 5 = 145. Answer: an estimated median of 145 g. The distractors: 150 g comes from giving the midpoint of the class that contains the median instead of interpolating inside it; 140 g comes from stopping at the lower boundary of that class, which locates the class but not the value; 155 g comes from measuring the 5 g step down from the upper boundary, 160 − 5, instead of up from the lower boundary.
13. (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.
14. (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.
15. (a) 8 — f(x − 1) means every input to f is reduced by 1 before it is looked up. At x = 2, the input to f becomes 2 − 1 = 1, so f(x − 1) at x = 2 is f(1) = 8. Reading f(2) = 4 directly from the table, without applying the shift, gives 4. Shifting in the wrong direction, using x + 1 = 3 instead of x − 1 = 1, gives f(3) = 1. Confusing f(x − 1) with f(x) − 1 — taking f(2) = 4 and then subtracting 1 — gives 3.
16. (b) It is not even an ordinary equation with a solution: expanding the left-hand side gives 3x − 12, and 3x − 12 = 3x − 4 would require −12 = −4, which is never true. — Expanding the left-hand side, 3(x − 4) = 3x − 12. Setting this equal to the right-hand side, 3x − 12 = 3x − 4, gives −12 = −4 once the 3x terms are removed from both sides — a statement that is never true, so no value of x satisfies the equation at all, and it is certainly not an identity. The option about substituting a specific value misunderstands algebraic expansion, which holds for every x, not one chosen value. The option matching the first term wrongly assumes that is enough to prove equivalence. The option about multiplying the 4 by 3 on both sides is nonsensical, since there is only one bracket to expand, on the left-hand side.
17. (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.
18. (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.