| Exam Board | SPS |
|---|
| Module | SPS FM Pure (SPS FM Pure) |
|---|
| Year | 2026 |
|---|
| Session | November |
|---|
| Topic | Proof by induction |
|---|
2. Prove by induction that, for all positive integers \(n\),
$$\sum _ { r = 1 } ^ { n } ( 2 r - 1 ) ^ { 2 } = \frac { 1 } { 3 } n \left( 4 n ^ { 2 } - 1 \right)$$
[BLANK PAGE]