FP2.6.3 Proof by induction of closed forms.

Section
FP2.6 Further sequences and series
Level
AS & A level
Statement
Proof by induction of closed forms.
Guidance
For example, if uₙ₊₁ − 3uₙ = 4 with u₁ = 1, prove by mathematical induction that uₙ = 3ⁿ − 2.
Since 2018
6 parts, 32 marks · topic pages: Recurrence relations and proof of closed forms

Back to the checklist

June 2025 · Paper 4A (Further Pure 2) · Q4(a) 6 marks
4. A sequence is defined by n 1 un+2 = 6un+1 – 8un u1 = 399.6 u2 = 798.4 (a) Prove by induction that, for n ∈ n) – 1 un = 200(2 10 (4 n) (6)
June 2023 · Paper 4A (Further Pure 2) · Q3(b) 5 marks
(b) Prove by induction that for n 1 n 325 4 ; U n :9 n (5)
June 2022 · Paper 4A (Further Pure 2) · Q3(b) 6 marks
The probability pn satisfies the recurrence relation pn +1 = 1 2 (1 – pn ) n 1 where p1 = 0 (b) Prove by induction that, for n 1 n pn = 2 + 1 ; :9 (6)
Nov 2021 · Paper 4A (Further Pure 2) · Q6 6 marks
6. A recurrence system is defined by 2 un - 3un+1 n 1 un+2 = 9(n + 1) u1 = -3, u2 = 18 Prove by induction that, for n ∈ , n n! un = (-3) (6)
Oct 2020 · AS Paper 2 (Further Pure 2) · Q4(b) 5 marks
(b) prove, by induction that, for n 1 An = (10 000 – 20F)1.05n – 1 + 20F (5)
June 2018 · AS Paper 2 (Further Pure 2) · Q3(b) 4 marks
(b) Prove by induction that Hn = 0.97n–1 + 5, n 1 (4)

Find an Edexcel Further Maths tutor

Stuck on this? Book a trial lesson with our Further Maths tutor.

Prefer email? Send an enquiry

If you are under 18, please include a parent's contact details. Enquiries go to enquiries@alevelfurthermathstutor.com and are deleted once handled.