May 2023 Paper 1 Q8
8.
(a) Consider the statement:
For all integers \(a\) and \(b\), if \(a\lt b\) then \(a^2\lt b^2\).
Find a counterexample to show that the statement is false. [1](b) Let \(n\) be an odd integer.
Prove directly that \(n^2-1\) is divisible by 4. [2]
Prove directly that \(n^2-1\) is divisible by 4. [2]
| Mark | Generic scheme | Illustrative scheme |
|---|---|---|
| •1 | provide counterexample and demonstrate 1,2,3 | \(a=-2, b=1\) 4 is not less than 1 or \(4\gt 1\) |
| (1) |
Notes:
- The values of \(a\) and \(b\) must be explicitly stated and the squares evaluated.
- Disregard any statement following a suitable demonstration.
- Where a candidate chooses eg \(a=-2\) and \(b=2\), then it is sufficient to observe that \(4=4\).
| Mark | Generic scheme | Illustrative scheme |
|---|---|---|
| •2 | appropriate form for \(n\) 1,2 | eg \(2k+1\), \(k\in\mathbb{Z}\) |
| •3 | factorise and communicate 3,4,5 | \(4\left(k^2+k\right)\) and eg which is divisible by \(4\) |
| (2) |
Notes:
- At •2, accept eg “\(k\) is an integer” but do not accept eg \(k\in\mathbb{N}\), \(k\in\mathbb{Z}^{+}\).
- Expression for \(n\) must be of the form \(2k+m\), where \(m\) is an odd integer.
- At •3, accept \(4k(k+1)\) for the factorisation.
- Award •3 if a candidate does not factorise but states that each term or coefficient (or equivalent) is divisible by 4.
- Acceptable communication for •3 includes “therefore true”, “\(\Rightarrow\) true”, “so statement is true”, “as required”. Simply writing “true” after factorised expression is insufficient.