| Exam Board | OCR MEI |
|---|---|
| Module | C3 (Core Mathematics 3) |
| Marks | 3 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Proof |
| Type | Proof by exhaustion with cases |
| Difficulty | Moderate -0.5 This is a straightforward proof by exhaustion requiring students to check all 1- and 2-digit perfect squares (1² through 9²), observe their final digits, and state the obvious generalization that no perfect square ends in 2, 3, 7, or 8. The computation is minimal and the reasoning is direct, making it easier than average but not trivial since it requires understanding proof by exhaustion and formulating a generalization. |
| Spec | 1.01a Proof: structure of mathematical proof and logical steps |
Use the method of exhaustion to prove the following result.
No 1- or 2-digit perfect square ends in 2, 3, 7 or 8
State a generalisation of this result. [3]
\hfill \mbox{\textit{OCR MEI C3 Q11 [3]}}