Edexcel F1 2015 January — Question 8

Exam BoardEdexcel
ModuleF1 (Further Pure Mathematics 1)
Year2015
SessionJanuary
TopicProof by induction

  1. (i) A sequence of numbers is defined by
$$\begin{gathered} u _ { 1 } = 5 \quad u _ { 2 } = 13
u _ { n + 2 } = 5 u _ { n + 1 } - 6 u _ { n } \quad n \geqslant 1 \end{gathered}$$ Prove by induction that, for \(n \in \mathbb { Z } ^ { + }\), $$u _ { n } = 2 ^ { n } + 3 ^ { n }$$ (ii) Prove by induction that for \(n \geqslant 2\), where \(n \in \mathbb { Z }\), $$f ( n ) = 7 ^ { 2 n } - 48 n - 1$$ is divisible by 2304
\includegraphics[max width=\textwidth, alt={}, center]{864a8956-ead0-4abd-91f4-1caa6d17f5e8-14_106_58_2403_1884}