| Exam Board | WJEC |
|---|---|
| Module | Unit 1 (Unit 1) |
| Year | 2024 |
| Session | June |
| Marks | 3 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Proof |
| Type | Proof by exhaustion with cases |
| Difficulty | Easy -1.2 This is a straightforward proof by exhaustion requiring only 6 simple calculations (checking n=1 through n=6) and basic divisibility checking. The method is explicitly stated, eliminating any problem-solving element, making it easier than average despite being a 'proof' question. |
| Spec | 1.01a Proof: structure of mathematical proof and logical steps |
Given that $n$ is an integer such that $1 \leqslant n \leqslant 6$, use proof by exhaustion to show that $n^2 - 2$ is not divisible by 3. [3]
\hfill \mbox{\textit{WJEC Unit 1 2024 Q4 [3]}}