June 2024 Unit 1 Q4
4. Given that \(n\) is an integer such that \(1\leqslant n\leqslant6\), use proof by exhaustion to show that \(n^2-2\) is not divisible by 3. [3]
| Scheme | Marks | Comments |
|---|---|---|
| \(\begin{array}{ll} n & n^2-2\\ 1 & -1\\ 2 & 2\\ 3 & 7\\ 4 & 14\\ 5 & 23\\ 6 & 34\end{array}\) | M1 | evaluating \(n^2-2\) (for 1,…,6) at least twice |
| A1 | at least 4 values correct. Implied by correct conclusion. | |
| \(n^2-2\) is not divisible by 3 for \(1\leq n\leq6\) | A1 | all values correct, and conclusion. |