| Exam Board | OCR MEI |
| Module | FP1 (Further Pure Mathematics 1) |
| Year | 2010 |
| Session | January |
| Topic | Proof by induction |
6 Prove by induction that \(1 \times 2 + 2 \times 3 + \ldots + n ( n + 1 ) = \frac { n ( n + 1 ) ( n + 2 ) } { 3 }\) for all positive integers \(n\).
Section B (36 marks)