October 2020 Paper 1 Q4
4 Prove by contradiction that there is no greatest multiple of 5. [3]
| Scheme | Marks | AO |
|---|---|---|
| Assume that there is a greatest multiple of 5 ie \(N = 5k\) | B1* | 2.1 |
| \(N + 5 = 5k + 5 = 5(k + 1)\) | M1 | 2.1 |
| This is a multiple of 5, and \(N + 5 \gt N\) which contradicts the assumption Hence there is no greatest multiple of 5 | A1d* | 2.4 |
| [3] |
Notes
B1*: Assumption for contradiction
Some indication that they are starting with the greatest multiple of 5
M1: Add on 5, or a multiple of 5
Or any equiv operation that would result in a larger multiple of 5
M0 if just numerical example
A1d*: Statement denying assumption
Need justification about why it is a multiple of 5, why it is greater, as well as ‘contradiction’ or clear equiv such as ‘initial assumption is incorrect’