June 2019 Paper 3 Q5
5 A student’s attempt to prove by contradiction that there is no largest prime number is shown below.
If there is a largest prime, list all the primes.
Multiply all the primes and add 1.
The new number is not divisible by any of the primes in the list and so it must be a new prime.
The proof is incorrect and incomplete.
Write a correct version of the proof. [3]
| Scheme | Marks | AO |
|---|---|---|
| Suppose there is a largest prime, [\(p\)] Multiply all the primes up to and including [\(p\)] and add 1 This number is not divisible by any of the primes | M1 | 2.1 |
| Therefore it is prime (and larger than \(p\)) | A1 | 2.3 |
| This is a contradiction (so there is no largest prime) | A1 | 2.4 |
| [3] |
Notes
M1: Allow ‘If there is …’ oe
A1: Must mention ‘contradiction’