CP1.1 Construct proofs using mathematical induction. Contexts include…

Section
CP1 Proof
Level
AS & A level
Statement
Construct proofs using mathematical induction. Contexts include sums of series, divisibility and powers of matrices.
Guidance
To include induction proofs for (i) summation of series, e.g. show Σ(r=1 to n) r³ = ¼n²(n + 1)² or show Σ(r=1 to n) r(r + 1) = n(n + 1)(n + 2)/3; (ii) divisibility, e.g. show 3²ⁿ + 11 is divisible by 4; (iii) matrix products, e.g. show (3 −4; 1 −1)ⁿ = (2n + 1 −4n; n 1 − 2n).
Since 2018
20 parts, 116 marks · topic pages: Proof by induction, Recurrence relations and proof of closed forms

Back to the checklist

June 2025 · AS Paper 1 (Core Pure) · Q6 6 marks
6. Prove by induction that for all positive integers n n : r n n ( 1) r (6)
June 2025 · Paper 2 (Core Pure 2) · Q3(a) 6 marks
3. Given A O ; :9 (a) prove by mathematical induction that, for n ∈ / n 5 2 An n (6)
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 2024 · AS Paper 1 (Core Pure) · Q7(i) 5 marks
7. (i) Prove by induction that, for all positive integers n, n O8 n / 1 r r n r (5)
June 2024 · AS Paper 1 (Core Pure) · Q7(ii) 5 marks
(ii) Prove by induction that, for all positive integers n, f ( n ) = 3 2n + 4 – 2 2 n is divisible by 5 (5)
June 2024 · Paper 1 (Core Pure 1) · Q6 6 marks
6. Prove by induction that, for all positive integers n, n / O8 / O r n n r (6)
June 2023 · Paper 1 (Core Pure 1) · Q4 5 marks
4. Prove by induction that for n ∈ n n ; ; 76 O :9 :9 (5)
June 2023 · Paper 2 (Core Pure 2) · Q6 6 marks
6. Given that 2x sinh x y = e prove by induction that for n ∈ n n n d y x e sinh x cosh x n d x (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 · AS Paper 1 (Core Pure) · Q7 6 marks
7. Prove by mathematical induction that, for n ∈ n n n - - = n n - - + (6)
June 2022 · Paper 2 (Core Pure 2) · Q3(a) 6 marks
a 3. M = where a is a constant (a) Prove by mathematical induction that, for n ∈ a ( n n 2 3 - ) M n = (6)
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 1 (Core Pure) · Q8 6 marks
8. Prove by induction that, for n ∈ + f(n) = 2n + 2 + 32n + 1 is divisible by 7 (6)
Oct 2020 · Paper 1 (Core Pure 1) · Q6(i) 6 marks Hard
6. (i) Prove by induction that for n ∈ + n =∑ ( r + )( r + ) = n n ( + )( n + ) r (6)
Oct 2020 · Paper 1 (Core Pure 1) · Q6(ii) 6 marks Hard
(ii) Prove by induction that for all positive odd integers n n + 5 n + 6 n f(n) = 4 is divisible by 15 (6)
June 2019 · AS Paper 1 (Core Pure) · Q3 6 marks
3. Prove by mathematical induction that, for ne N =I (2r-1)(2r+1) 2n+l1
June 2019 · Paper 1 (Core Pure 1) · Q6 6 marks
6. Prove by induction that for all positive integers n f (௘n௘) = 32n + 4 í 22n is divisible by 5 (6)
June 2018 · AS Paper 1 (Core Pure) · Q8(i) 6 marks
8. (i) Prove by induction that for n + n - n + - n = - n - n (6)
June 2018 · AS Paper 1 (Core Pure) · Q8(ii) 6 marks
(ii) Prove by induction that for n + f (n) = 4n + 1 + 52n – 1 is divisible by 21 (6)

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.