June 2019 Unit 1 Q5
5. Given that \(n\) is an integer such that \(1\leqslant n\leqslant 4\), prove that \(2n^2+5\) is a prime number. [3]
| Scheme | Marks | Comments | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Using proof by exhaustion | M1 | attempt to find \(2n^2+5\) for \(n=1,2,3,4\) | ||||||||||
| B1 | at least 3 correct | ||||||||||
| 7, 13, 23 and 37 are prime numbers. | A1 | |||||||||||
| Therefore the statement is true. |