Standard +0.3 This is a straightforward proof by induction with a simple recurrence relation. The base case is trivial (u₁ = 5 = 2² + 1), and the inductive step requires only basic algebraic manipulation of powers of 2. While it's a Further Maths topic, it's a standard textbook exercise requiring no novel insight—slightly easier than average overall but typical for FP1 induction questions.
6 A sequence is defined by \(u _ { 1 } = 5\) and \(u _ { n + 1 } = u _ { n } + 2 ^ { n + 1 }\). Prove by induction that \(u _ { n } = 2 ^ { n + 1 } + 1\).
6 A sequence is defined by $u _ { 1 } = 5$ and $u _ { n + 1 } = u _ { n } + 2 ^ { n + 1 }$. Prove by induction that $u _ { n } = 2 ^ { n + 1 } + 1$.
\hfill \mbox{\textit{OCR MEI FP1 2011 Q6 [6]}}