May 2026 Paper 2 Q12
12. Prove by induction that \(7^n+2\) is divisible by 3 for all \(n\in\mathbb{N}\). [5]
| Mark | Generic scheme | Illustrative scheme |
|---|---|---|
| •1 | show true for \(n=1\) 1,2,3 | \(7^1+2=9\) true for \(n=1\) |
| •2 | assume true for \(n=k\) 3,4,5,6,7 and consider whether true for \(n=k+1\) 2,3 | suitable statement and \(7^k+2\) is divisible by 3 or \(7^k+2=3m\), where \(m\in\mathbb{Z}\). and \(7^{k+1}+2=\ldots7^k\ldots\) |
| •3 | write \(7^{k+1}+2\) in terms of \(7^k\) and 2 | \(7\times7^k+2\) |
| •4 | use inductive hypothesis 8 | \(7(3m-2)+2\) |
| •5 | write expression with factor of 3 and communicate 8,9 | \(3(7m-4)\) and If true for \(n=k\) then true for \(n=k+1\). But true for \(n=1\). Therefore true for all \(n\in\mathbb{N}\) by induction. |
| (5) |
Notes:
- Accept eg “so true” if the candidate has begun with eg “\(n=1:\)”. The statement for •1 may appear at •5.
- For the award of •1, full substitution (ie \(7^1\)) must appear.
- Where a candidate uses divisibility notation incorrectly (eg 9|3), withhold the mark where it first appears, but not subsequently. This applies even if the candidate states or implies its meaning.
- For •2 sufficient phrases for \(n=k\) contain:
- ‘If true for…’, ‘Suppose true for…’, ‘Assume true for…’.
- ‘Consider \(n=k\)’, ‘Assume \(n=k\)’, ‘Let \(n=k\)’, ‘Assume \(n=k\) is true’, ‘True for \(n=k\)’.
For •2, unacceptable phrases for \(n=k\) contain:- ‘Assume true \(\forall k\in\mathbb{N}\)’
- ‘Consider true for \(n=k+1\)’, ‘True for \(n=k+1\)’.
- Do not award •2 for ‘\(7^k+2=3k\)’ or ‘\(7^k+2=3n\)’.
- For the award of •2, the RHS of the expression for \(7^{k+1}+2=\ldots\) must be an expression containing \(7^k\), or it must be stated that there is a requirement to prove that it is equal to 3 times a letter which is not used elsewhere, or that \(7^{k+1}+2\) is divisible by 3.
- Do not withhold •2 for the omission of a source set.
- For candidates who have not been awarded •4, •5 is unavailable.
- Following the required algebra and statement of the inductive hypothesis, the minimal acceptable communication for •5 is “Then true for \(n=k+1\). But since true for \(n=1\), then true for all \(n\)”, or equivalent.
Commonly Observed Responses:
COR A (Express \(7^{k+1}+2\) as \((6+1)7^k+2\))
| \(7\times7^k+2\) or \((6+1)7^k+2\) | •3 |
| \(6\times7^k+3m\) | •4 |
| \(3\left(2\times7^k+m\right)\) and communication. | •5 |
COR B (Express \(7^{k+1}+2\) as \(7\left(7^k+2\right)-14+2\))
| \(7\times7^k+2\) or \(7\left(7^k+2\right)-14+2\) | •3 |
| \(7\times3m-14+2\) | •4 |
| \(3(7m-4)\) and communication. | •5 |
COR C (Candidate does not write \(7^k+2=3m\) but has, instead, stated that this is a multiple of 3).
eg
| \(7\times7^k+2\) | •3 |
| \(6\times7^k+7^k+2\) | •4 |
| \(7^k+2\) is divisible by 3 and \(6\times7^k\) is divisible by 3 and so \(7^{k+1}+2\) is divisible by 3 and communication. | •5 |
COR D (repeated use of letter indicating divisibility in inductive hypothesis)
| \(\begin{aligned}7^1+2&=9\\&=3m\end{aligned}\) | |
| \(7^k+2=3m\) | Do not withhold •2. |