Edexcel F1 2016 June — Question 10 11 marks

Exam BoardEdexcel
ModuleF1 (Further Pure Mathematics 1)
Year2016
SessionJune
Marks11
PaperDownload PDF ↗
TopicProof by induction
TypeProve recurrence relation formula
DifficultyStandard +0.3 This is a standard two-part induction question from Further Pure 1. Part (i) involves proving a closed form for a linear recurrence relation, which is routine once students substitute into the recurrence. Part (ii) is a summation proof requiring algebraic manipulation but follows the standard induction template. Both parts are textbook exercises with no novel insight required, making this slightly easier than average for Further Maths students who have practiced induction.
Spec4.01a Mathematical induction: construct proofs

10. (i) A sequence of positive numbers is defined by $$\begin{aligned} u _ { 1 } & = 5 \\ u _ { n + 1 } & = 3 u _ { n } + 2 , \quad n \geqslant 1 \end{aligned}$$ Prove by induction that, for \(n \in \mathbb { Z } ^ { + }\), $$u _ { n } = 2 \times ( 3 ) ^ { n } - 1$$ (ii) Prove by induction that, for \(n \in \mathbb { Z } ^ { + }\), $$\sum _ { r = 1 } ^ { n } \frac { 4 r } { 3 ^ { r } } = 3 - \frac { ( 3 + 2 n ) } { 3 ^ { n } }$$

10. (i) A sequence of positive numbers is defined by

$$\begin{aligned}
u _ { 1 } & = 5 \\
u _ { n + 1 } & = 3 u _ { n } + 2 , \quad n \geqslant 1
\end{aligned}$$

Prove by induction that, for $n \in \mathbb { Z } ^ { + }$,

$$u _ { n } = 2 \times ( 3 ) ^ { n } - 1$$

(ii) Prove by induction that, for $n \in \mathbb { Z } ^ { + }$,

$$\sum _ { r = 1 } ^ { n } \frac { 4 r } { 3 ^ { r } } = 3 - \frac { ( 3 + 2 n ) } { 3 ^ { n } }$$

\hfill \mbox{\textit{Edexcel F1 2016 Q10 [11]}}