Moderate -0.3 This is a straightforward proof by induction with a given formula for a simple recurrence relation. The base case is trivial (u₁ = 4 = 3¹ + 1), and the inductive step requires only direct substitution into the recurrence relation and basic algebra. While induction is a Further Maths topic, this particular question is more routine than average A-level difficulty due to its mechanical nature and lack of conceptual obstacles.
1 The sequence \(u _ { 1 } , u _ { 2 } , u _ { 3 } , \ldots\) is such that \(u _ { 1 } = 4\) and \(u _ { n + 1 } = 3 u _ { n } - 2\) for \(n \geqslant 1\).
Prove by induction that \(u _ { n } = 3 ^ { n } + 1\) for all positive integers \(n\).
1 The sequence $u _ { 1 } , u _ { 2 } , u _ { 3 } , \ldots$ is such that $u _ { 1 } = 4$ and $u _ { n + 1 } = 3 u _ { n } - 2$ for $n \geqslant 1$.\\
Prove by induction that $u _ { n } = 3 ^ { n } + 1$ for all positive integers $n$.\\
\hfill \mbox{\textit{CAIE Further Paper 1 2024 Q1 [5]}}