May 2026 Paper 2 Q4
4.
(a) Use the Euclidean algorithm to find \(d\), the greatest common divisor of 1428 and 567. [1]
(b) Find integers \(a\) and \(b\) such that \(1428a+567b=d\). [2]
| Mark | Generic scheme | Illustrative scheme |
|---|---|---|
| •1 | obtain and identify \(d\) 1,2 | eg \(1428=2\times567+294\), leading to eg 21 or gcd = 21 |
| (1) |
Notes:
- The gcd must be clearly identified in (a) or, if not identified in (a), implied by its use in (b).
- There must be evidence of the Euclidean algorithm or a related process.
| Mark | Generic scheme | Illustrative scheme |
|---|---|---|
| •2 | express gcd in terms of 567 and 294 1,2,3 | \(21=294-1\times(567-1\times294)\ldots\) |
| •3 | determine \(a\) and \(b\) 1,3,4,5 | \(a=2\), \(b=-5\) |
| (2) |
Notes:
- For the correct answer with no working, award 0/2.
- At •2, the expression may involve 567, 294 and 1428.
- Where a candidate misidentifies the gcd in part (a), •2 and •3 are still available for the appearance of “\(21=\ldots\)” accompanied by appropriate working. Otherwise, award 0/2.
- At •3, the minimum requirement is \(1428\times(2)+567\times(-5)=21\).
- Do not accept \(21=2\times1428-5\times567\) as a final answer.