Induction for series sums, divisibility results, matrix powers and recurrence relations, with the full basis, assumption, inductive step and conclusion.
12 original questions, 72 marks. Type your answers below for an instant mark and a score (algebra in any equivalent form, e.g. 2sqrt(3) or 2√3), or print the worksheet, mark it with the answers sheet, and use the solutions to see every step written out by hand.
Σ(4r - 1) = n(2n + 1) for all positive integers n, proved by induction
2
Prove by induction that, for n ∈ ℤ+, 11n − 6 is divisible by 5
4 marks
Show answer
11n - 6 is divisible by 5 for all positive integers n, proved by induction
3
A sequence is defined by
u1 = 3, un + 1 = 2un − 1
Prove by induction that, for n ∈ ℤ+, un = 2n + 1
4 marks
Show answer
uₙ = 2n + 1 for all positive integers n, proved by induction
4
Prove by induction that, for n ∈ ℤ+,
nΣr = 1r(r + 2) = 16n(n + 1)(2n + 7)
5 marks
Show answer
Σr(r + 2) = (1/6)n(n + 1)(2n + 7) for all positive integers n, proved by induction
5
Prove by induction that, for n ∈ ℤ+,
1
0
3
4
n =
1
0
4n − 1
4n
5 marks
Show answer
(1, 0; 3, 4)n = (1, 0; 4n - 1, 4n) for all positive integers n, proved by induction
6
Prove by induction that, for n ∈ ℤ+,
f(n) = 72n − 1 + 5
is divisible by 12
6 marks
Show answer
7(2n - 1) + 5 is divisible by 12 for all positive integers n, proved by induction
7
Prove by induction that, for n ∈ ℤ+,
nΣr = 11(2r + 1)(2r + 3) = n3(2n + 3)
6 marks
Show answer
Σ1/((2r + 1)(2r + 3)) = n/(3(2n + 3)) for all positive integers n, proved by induction
8
Prove by induction that, for all positive odd integers n,
f(n) = 3n + 5n
is divisible by 8
6 marks
Show answer
3n + 5n is divisible by 8 for all positive odd integers n, proved by induction
9
A sequence of positive integers is defined by
u1 = 6, un + 1 = 3un + 4n
Prove by induction that, for n ∈ ℤ+,
un = 3n + 1 − 2n − 1
6 marks
Show answer
uₙ = 3(n + 1) - 2n - 1 for all positive integers n, proved by induction
10
The matrix M =
3
−2
2
−1
Prove by induction that, for n ∈ ℤ+,
3
−2
2
−1
n =
1 + 2n
−2n
2n
1 − 2n
The transformation represented by Mn maps the point A(3, 1) to the point A′(43, 41). Find the value of n.
A shape S of area 12 cm2 is transformed by Mn. Show that the area of the image does not depend on n, and state its value.
9 marks
Show answer
a) proved by inductionb) n = 10c) 12 cm2
11
Kwame makes a sequence of tile patterns. Pattern 1 uses 5 tiles, and to make pattern (n + 1) from pattern n he adds 4n + 5 more tiles. So the number of tiles Tn in pattern n satisfies
T1 = 5, Tn + 1 = Tn + 4n + 5
Prove by induction that, for n ∈ ℤ+, Tn = 2n2 + 3n
One of Kwame's patterns uses exactly 1034 tiles. Find which pattern this is.
7 marks
Show answer
a) proved by inductionb) pattern 22
12
The matrix A =
2
1
0
2
Find A2 and A3
Show that the results of part (a) fit the formula An =
2n
n × 2n − 1
0
2n
and prove by induction that this formula holds for all n ∈ ℤ+.
A triangle of area 3 cm2 is transformed by An to a triangle of area 3072 cm2. Find the value of n, and hence write down An for this value.
10 marks
Show answer
a) A2 = (4, 4; 0, 4), A3 = (8, 12; 0, 8)b) proved by inductionc) n = 5, A5 = (32, 80; 0, 32)
Your score
Answer the questions above and your score appears here.
Every question here is original and written by Robinson Tuition. It follows the Edexcel AS Further Mathematics specification and suits AQA and OCR Further Maths too; this is not an exam-board paper.