June 2018 Paper 1 Q5
5 \(N\) is an integer that is not divisible by 3. Prove that \(N^2\) is of the form \(3p + 1\), where \(p\) is an integer. [5]
| Scheme | Marks | AO |
|---|---|---|
| \(N = 3k + 1\) or \(N = 3k + 2\) (where \(k\) is an integer) | M1 | 3.1a |
| \((3k + 1)^2\) | \((3k + 2)^2\) | M1 | 1.1 |
| \(= 9k^2 + 6k + 1\) | \(= 9k^2 + 12k + 4\) | A1 | 2.1 |
| \(= 3(3k^2 + 2k) + 1\) or \(= 3(3k^2 + 4k + 1) + 1\) | A1 | 2.4 |
| Both these are of form \(3p + 1\), \(p\) an integer | E1 | 2.2a |
| [5] |
Notes
M1 (first): One of these. Allow without "\(N =\)". Any letter other than \(p\)
M1 (second): Attempt one of these. Allow \(p\)
A1 (first): Both correct. Allow \(p\)
A1 (second): Or \(9k^2 + 6k\) div by 3 or \(9k^2 + 12k + 3\) div by 3
One of these. or similar in words. Allow \(p\)
E1: Must say \(p\) is integer or \(3k^2 + 2k\) and \(3k^2 + 4k + 1\) are integers
Dep on M1M1A1A1
\(N = 3p + 1\): max M0M1A1A1E0
Similar marks for method using \(N = 3k + 1\) & \(N = 3k - 1\)