Standard +0.8 This is a Further Maths induction proof involving factorials and a non-standard summation. While the inductive step follows a clear structure, students must carefully manipulate factorial expressions and expand (n+1)² correctly. The algebraic manipulation is more demanding than typical A-level induction proofs, but remains within standard FP2 expectations.
5 Prove by induction that for all integers $n \geqslant 1$
$$\sum _ { r = 1 } ^ { n } \left( r ^ { 2 } + 1 \right) ( r ! ) = n ( n + 1 ) !$$
\hfill \mbox{\textit{AQA FP2 2008 Q5 [7]}}