Standard +0.3 This is a straightforward proof by induction of a recurrence relation formula. The base case is trivial (u₁ = 5 checks out), and the inductive step requires only substituting the assumed formula into the recurrence relation and simplifying algebraically. While it's a Further Maths topic, it follows a completely standard template with no conceptual challenges or novel insights required, making it slightly easier than average overall.
5 The sequence \(u _ { 1 } , u _ { 2 } , u _ { 3 } , \ldots\) is defined by
$$u _ { 1 } = 5 \text { and } u _ { n + 1 } = 3 u _ { n } + 2 \text { for } n \geqslant 1 \text {. }$$
Prove by induction that \(u _ { n } = 2 \times 3 ^ { n } - 1\).