MrFurtherMaths

ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Mark Scheme
Question Scheme Marks AOs

1 Way 1: 𝒇(𝒌 + 𝟏) − 𝒇(𝒌)

When 𝑛 = 1, 2𝑛+2 + 32𝑛+1 = 23 + 33 = 35 B1 2.2a
Shows the statement is true for 𝑛 = 1, allow 5(7)

Assume true for 𝑛 = 𝑘, so 2𝑘+2 + 32𝑘+1 is divisible by 7 M1 2.4

𝑓(𝑘 + 1) − 𝑓(𝑘) = 2𝑘+3 + 32𝑘+3 − (2𝑘+2 + 32𝑘+1 ) M1 2.1

= 2 × 2𝑘+2 + 9 × 32𝑘+1 − 2𝑘+2 − 32𝑘+1
= 2𝑘+2 + 8 × 32𝑘+1 A1 1.1b
= 𝑓(𝑘) + 7 × 32𝑘+1 or 8f(𝑘) − 7 × 2𝑘+2
𝑓(𝑘 + 1) = 2𝑓(𝑘) + 7 × 32𝑘+1 or 9f(𝑘) − 7 × 2𝑘+2 A1 1.1b
If true for 𝑛 = 𝑘 then true for 𝑛 = 𝑘 + 1 and as it is true for 𝑛 = 1
A1 2.4
the statement is true for all (positive integers) n
(6)
Way 2: 𝒇(𝒌 + 𝟏)

B1 2.2a
When 𝑛 = 1, 2𝑛+2 + 32𝑛+1 = 23 + 33 = 35
So the statement is true for 𝑛 = 1

Assume true for 𝑛 = 𝑘, so 2𝑘+2 + 32𝑘+1 is divisible by 7 M1 2.4

𝑓(𝑘 + 1) = 2(𝑘+1)+2 + 32(𝑘+1)+1 M1 2.1

𝑓(𝑘 + 1) = 2𝑘+3 + 32𝑘+3 = 2 × 2𝑘+2 + 9 × 32𝑘+1
A1 1.1b
= 2(2𝑘+2 + 32𝑘+1 ) + 7 × 32𝑘+1
A1 1.1b
= 2𝑓(𝑘) + 7 × 32𝑘+1 or 9f(𝑘) − 7 × 2𝑘+2
If true for 𝑛 = 𝑘 then true for 𝑛 = 𝑘 + 1 and as it is true for 𝑛 = 1
A1 2.4
the statement is true for all (positive integers) n
(6)
Way 3: 𝒇(𝒌 + 𝟏) − 𝒎 𝒇(𝒌)

B1 2.2a
When 𝑛 = 1, 2𝑛+2 + 32𝑛+1 = 23 + 33 = 35
So the statement is true for 𝑛 = 1

Assume true for 𝑛 = 𝑘, so 2𝑘+2 + 32𝑘+1 is divisible by 7 M1 2.4

MrFurtherMaths Resources 1 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

𝑓(𝑘 + 1) − 𝑚𝑓(𝑘) = 2𝑘+3 + 32𝑘+3 − 𝑚(2𝑘+2 + 32𝑘+1 ) M1 2.1

= 2 × 2𝑘+2 + 9 × 32𝑘+1 − 𝑚 × 2𝑘+2 − 𝑚 × 32𝑘+1
= (2 − 𝑚)2𝑘+2 + 9 × 32𝑘+1 − 𝑚 × 32𝑘+1 A1 1.1b
= (2 − 𝑚)(2𝑘+2 + 32𝑘+1 ) + 7 × 32𝑘+1
𝑓(𝑘 + 1) = (2 − 𝑚)(2𝑘+2 + 32𝑘+1 ) + 7 × 32𝑘+1 + 𝑚𝑓(𝑘) A1 1.1b
If true for 𝑛 = 𝑘 then true for 𝑛 = 𝑘 + 1 and as it is true for 𝑛 = 1
A1 2.4
the statement is true for all (positive integers) n
(6)

(6 marks)

Notes:
Way 1: 𝒇(𝒌 + 𝟏) − 𝒇(𝒌)
B1: Shows that f(1) = 35 and concludes or shows divisible by 7. This may be seen in the final
statement.
M1: Makes a statement that assumes the result is true for some value of n
M1: Attempts 𝑓(𝑘 + 1) − 𝑓(𝑘)
A1: Achieves a correct expression for 𝑓(𝑘 + 1) − 𝑓(𝑘) in terms of 𝑓(𝑘)
A1: Reaches a correct expression for 𝑓(𝑘 + 1)in terms of 𝑓(𝑘)
A1: Correct conclusion. This mark is dependent on all previous marks, look out for scoring B1 in
this statement. It is gained by conveying the ideas of all four bold points either at the end of their
solution or as a narrative in their solution.
Way 2: 𝒇(𝒌 + 𝟏)
B1: Shows that f(1) = 35 and concludes divisible by 7
M1: Makes a statement that assumes the result is true for some value of n
M1: Attempts𝑓(𝑘 + 1)
A1: Correctly obtains either 2f(𝑘)or7 × 32𝑘+1 or either 9f(𝑘) or − 7 × 2𝑘+2
A1: Reaches a correct expression for 𝑓(𝑘 + 1)in terms of 𝑓(𝑘)
A1: Correct conclusion. This mark is dependent on all previous marks. It is gained by conveying the
ideas of all four bold points either at the end of their solution or as a narrative in their solution.
Way 3: 𝒇(𝒌 + 𝟏) − 𝒎 𝒇(𝒌)
B1: Shows that f(1) = 35 and concludes divisible by 7
M1: Makes a statement that assumes the result is true for some value of n
M1: Attempts𝑓(𝑘 + 1) − 𝑚𝑓(𝑘)
A1: Achieves a correct expression for 𝑓(𝑘 + 1) − 𝑚𝑓(𝑘)in terms of 𝑓(𝑘)
A1: Reaches a correct expression for 𝑓(𝑘 + 1) in terms of 𝑓(𝑘)
A1: Correct conclusion. This mark is dependent on all previous marks. It is gained by conveying the
ideas of all four bold points either at the end of their solution or as a narrative in their solution.

MrFurtherMaths Resources 2 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

2(i) 5 −8 1 5 −8 4×1+1 −8(1)

𝑛 = 1, ( ) =( ),( )
2 −3 2 −3 2×1 1 − 4(1)
5 −8 B1 2.2a
=( )
2 −3
So the result is true for n = 1
5 −8 𝑘 4𝑘 + 1 −8𝑘 M1 2.4
Assume true for n = k so ( ) =( )
2 −3 2𝑘 1 − 4𝑘
5 −8 𝑘+1 4𝑘 + 1 −8𝑘 5 −8
( ) =( )( )
2 −3 2𝑘 1 − 4𝑘 2 −3
or M1 1.1b
𝑘+1
5 −8 5 −8 4𝑘 + 1 −8𝑘
( ) =( )( )
2 −3 2 −3 2𝑘 1 − 4𝑘
4𝑘 + 1 −8𝑘 5 −8
( )( )
2𝑘 1 − 4𝑘 2 −3
5(4𝑘 + 1) − 16𝑘 −8(4𝑘 + 1) + 24𝑘
=( )
10𝑘 + 2(1 − 4𝑘) −16𝑘 − 3(1 − 4𝑘)
or A1 1.1b
5 −8 4𝑘 + 1 −8𝑘
( )( )
2 −3 2𝑘 1 − 4𝑘
5(4𝑘 + 1) − 16𝑘 −40𝑘 − 8(1 − 4𝑘)
=( )
2(1 + 4𝑘) − 6𝑘 −16𝑘 − 3(1 − 4𝑘)
4(𝑘 + 1) + 1 −8(𝑘 + 1)
=( ) A1 2.1
2(𝑘 + 1) 1 − 4(𝑘 + 1)
If true for n = k then true for n = k + 1, true for n = 1 so true for
A1 2.4
all (positive integers) n (Allow “for all values”)
(6)
(ii) f(k + 1) – f(k)
𝑛+1
Way 1 When n = 1, 4 + 52𝑛−1 = 16 + 5 = 21
B1 2.2a
so the statement is true for n = 1
Assume true for n = k so 4𝑘+1 + 52𝑘−1 is divisible by 21 M1 2.4
𝑓(𝑘 + 1) − 𝑓(𝑘) = 4𝑘+2 + 52𝑘+1 − 4𝑘+1 − 52𝑘−1 M1 2.1
= 4 × 4𝑘+1 + 25 × 52𝑘−1 − 4𝑘+1 − 52𝑘−1
= 3𝑓(𝑘) + 21 × 52𝑘−1 or e.g. = 24𝑓(𝑘) − 21 × 4𝑘+1 A1 1.1b
𝑓(𝑘 + 1) = 4𝑓(𝑘) + 21 × 52𝑘−1 or e.g. 𝑓(𝑘 + 1) = 25𝑓(𝑘) −
A1 1.1b
21 × 4𝑘+1
If true for n = k then true for n = k + 1, true for n = 1 so true for
A1 2.4
all (positive integers) n (Allow “for all values”)
(6)

MrFurtherMaths Resources 3 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

(ii) f(k + 1)
Way 2 When n = 1, 4𝑛+1 + 52𝑛−1 = 16 + 5 = 21
B1 2.2a
so the statement is true for n = 1
Assume true for n = k so 4𝑘+1 + 52𝑘−1 is divisible by 21 M1 2.4
𝑓(𝑘 + 1) = 4𝑘+1+1 + 52(𝑘+1)−1 M1 2.1
𝑘+1 2𝑘+1
𝑓(𝑘 + 1) = 4 × 4 +5
= 4 × 4𝑘+1 + 4 × 52𝑘−1 + 25 × 52𝑘−1 A1 1.1b
− 4 × 52𝑘−1 A1 1.1b
𝑓(𝑘 + 1) = 4𝑓(𝑘) + 21 × 52𝑘−1
If true for n = k then true for n = k + 1, true for n = 1 so true for
A1 2.4
all (positive integers) n (Allow “for all values”)
(6)
(ii) f(k + 1) – mf(k)
Way 3 When n = 1, 4𝑛+1 + 52𝑛−1 = 16 + 5 = 21
B1 2.2a
so the statement is true for n = 1
Assume true for n = k so 4𝑘+1 + 52𝑘−1 is divisible by 21 M1 2.4
𝑓(𝑘 + 1) − 𝑚𝑓(𝑘) = 4𝑘+2 + 52𝑘+1 − 𝑚(4𝑘+1 + 52𝑘−1 ) M1 2.1

= (4 − 𝑚)4𝑘+1 + 52𝑘+1 − 𝑚 × 52𝑘−1

A1 1.1b
= (4 − 𝑚)(4𝑘+1 + 52𝑘−1 ) + 21 × 52𝑘−1

= (4 − 𝑚)(4𝑘+1 + 52𝑘−1 ) + 21 × 52𝑘−1 + 𝑚𝑓(𝑘) A1 1.1b

If true for n = k then true for n = k + 1, true for n = 1 so true for
A1 2.4
all (positive integers) n (Allow “for all values”)
(6)
(ii) f(k) = 21M
Way 4 When n = 1, 4 𝑛+1
+ 52𝑛−1 = 16 + 5 = 21
B1 2.2a
so the statement is true for n = 1
Assume true for n = k so 4𝑘+1 + 52𝑘−1 = 21𝑀 M1 2.4
𝑓(𝑘 + 1) = 4𝑘+1+1 + 52(𝑘+1)−1 M1 2.1
𝑘+1 2𝑘+1 2𝑘−1 ) 2𝑘+1
𝑓(𝑘 + 1) = 4 × 4 +5 = 4(21𝑀 − 5 +5 A1 1.1b
2𝑘−1
𝑓(𝑘 + 1) = 84𝑀 + 21 × 5 A1 1.1b
If true for n = k then true for n = k + 1, true for n = 1 so true for
A1 2.4
all (positive integers) n (Allow “for all values”)
(6)
(12 marks)

MrFurtherMaths Resources 4 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Notes
(i)
B1: Shows that the result holds for n = 1. Must see substitution into the rhs.
4+1 −8 5 −8
The minimum would be: ( )=( ).
2 1−4 2 −3
M1: Makes a statement that assumes the result is true for some value of n (Assume (true for)
n = k is sufficient – note that this may be recovered in their conclusion if they say e.g. if true for n
= k then … etc.)
M1: Sets up a correct multiplication statement either way round
A1: Achieves a correct un-simplified matrix
A1: Reaches a correct simplified matrix with no errors and the correct un-simplified matrix
seen previously. Note that the simplified result may be proved by equivalence.
A1: Correct conclusion. This mark is dependent on all previous marks apart from the B mark. It
is gained by conveying the ideas of all four underlined points either at the end of their solution
or as a narrative in their solution.
(ii) Way 1
B1: Shows that f(1) = 21
M1: Makes a statement that assumes the result is true for some value of n (Assume (true for)
n = k is sufficient – note that this may be recovered in their conclusion if they say e.g. if true for
n = k then … etc.)
M1: Attempts f(k + 1) – f(k) or equivalent work
A1: Achieves a correct expression for f(k + 1) – f(k) in terms of f(k)
A1: Reaches a correct expression for f(k + 1) in terms of f(k)
A1: Correct conclusion. This mark is dependent on all previous marks apart from the B mark. It
is gained by conveying the ideas of all four underlined points either at the end of their solution
or as a narrative in their solution.
Way 2
B1: Shows that f(1) = 21
M1: Makes a statement that assumes the result is true for some value of n (Assume (true for)
n = k is sufficient – note that this may be recovered in their conclusion if they say e.g. if true for
n = k then … etc.)
M1: Attempts f(k + 1)
A1: Correctly obtains 4f(k) or 21 × 52𝑘−1
A1: Reaches a correct expression for f(k + 1) in terms of f(k)
A1: Correct conclusion. This mark is dependent on all previous marks apart from the B mark. It
is gained by conveying the ideas of all four underlined points either at the end of their solution
or as a narrative in their solution.
Way 3
B1: Shows that f(1) = 21
M1: Makes a statement that assumes the result is true for some value of n (Assume (true for)
n = k is sufficient – note that this may be recovered in their conclusion if they say e.g. if true for
n = k then … etc.)
M1: Attempts f(k + 1) – mf(k)
A1: Achieves a correct expression for f(k + 1) – mf(k) in terms of f(k)
A1: Reaches a correct expression for f(k + 1) in terms of f(k)

MrFurtherMaths Resources 5 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

A1: Correct conclusion. This mark is dependent on all previous marks apart from the B mark. It
is gained by conveying the ideas of all four underlined points either at the end of their solution
or as a narrative in their solution.
Way 4
B1: Shows that f(1) = 21
M1: Makes a statement that assumes the result is true for some value of n (Assume (true for)
n = k is sufficient – note that this may be recovered in their conclusion if they say e.g. if true for
n = k then … etc.)
M1: Attempts f(k + 1)
A1: Correctly obtains 84M or 21 × 52𝑘−1
A1: Reaches a correct expression for f(k + 1) in terms of M and 52𝑘−1
A1: Correct conclusion. This mark is dependent on all previous marks apart from the B mark. It
is gained by conveying the ideas of all four underlined points either at the end of their solution
or as a narrative in their solution.

MrFurtherMaths Resources 6 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

3 Way 1 f(k +1) – f(k)

When n = 1, 32𝑛+4 − 22𝑛 = 729 − 4 = 725
B1 2.2a
(725 = 145 × 5) so the statement is true for n = 1
Assume true for n = k so 32𝑘+4 − 22𝑘 is divisible by 5 M1 2.4

𝑓(𝑘 + 1) − 𝑓(𝑘) = 32𝑘+6 − 22𝑘+2 − 32𝑘+4 + 22𝑘 M1 2.1

either 8𝑓(𝑘) + 5 × 22𝑘 or 3f(𝑘) + 5 × 32𝑘+4 A1 1.1b
𝑓(𝑘 + 1) = 9𝑓(𝑘) + 5 × 22𝑘 or 𝑓(𝑘 + 1) = 4𝑓(𝑘) + 5 × 32𝑘+4
A1 1.1b
o.e.
If true for n = k then it is true for
n = k + 1 and as it is true for n = 1, the statement is true for all A1 2.4
(positive integers) n. (Allow ‘for all values’)
(6)

Way 2 f(k +1)

When n = 1, 32𝑛+4 − 22𝑛 = 729 − 4 = 725
B1 2.2a
(725 = 145 × 5)so the statement is true for n = 1
Assume true for n = k so 32𝑘+4 − 22𝑘 is divisible by 5 M1 2.4

𝑓(𝑘 + 1) = 32(𝑘+1)+4 − 22(𝑘+1) (= 32𝑘+6 − 22𝑘+2 ) M1 2.1

A1 1.1b
𝑓(𝑘 + 1) = 9𝑓(𝑘) + 5 × 22𝑘 or 𝑓(𝑘 + 1) = 4𝑓(𝑘) + 5 × 32𝑘+4 o.e.
A1 1.1b
If true for n = k then it is true for
n = k + 1 and as it is true for n = 1, the statement is true for all A1 2.4
(positive integers) n. (Allow ‘for all values’)
(6)

Way 3 f(k) = 5M
When n = 1, 32𝑛+4 − 22𝑛 = 729 − 4 = 725
B1 2.2a
(725 = 145 × 5) so the statement is true for n = 1
Assume true for n = k so 32𝑘+4 − 22𝑘 = 5M M1 2.4

𝑓(𝑘 + 1) = 32(𝑘+1)+4 − 22(𝑘+1) (= 32𝑘+6 − 22𝑘+2 ) M1 2.1

(𝑓(𝑘 + 1) = 32 × 32𝑘+4 − 22 × 22𝑘
= 32 × (5𝑀 + 22𝑘+2 ) − 22 × 22𝑘 )
𝑓(𝑘 + 1) = 45𝑀 + 5 × 22𝑘 o.e.
OR A1 1.1b
(𝑓(𝑘 + 1) = 32 × 32𝑘+4 − 22 × 22𝑘 A1 1.1b

= 32 × 32𝑘+4 − 22 × (32𝑘+4 − 5𝑀))

𝑓(𝑘 + 1) = 5 × 32𝑘+4 + 20𝑀 o.e.

MrFurtherMaths Resources 7 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

If true for n = k then it is true for

n = k + 1 and as it is true for n = 1, the statement is true for all A1 2.4
(positive integers) n. (Allow ‘for all values’)
(6)

Way 4 f(k +1) + f(k)

When n = 1, 32𝑛+4 − 22𝑛 = 729 − 4 = 725
B1 2.2a
(725 = 145 × 5)so the statement is true for n = 1
Assume true for n = k so 32𝑘+4 − 22𝑘 is divisible by 5 M1 2.4

𝑓(𝑘 + 1) + f(𝑘) = 32𝑘+6 − 22𝑘+2 + 32𝑘+4 − 22𝑘 M1 2.1

𝑓(𝑘 + 1) + f(𝑘) = 32 × 32𝑘+4 − 22 × 22𝑘 + 32𝑘+4 − 22𝑘
A1 1.1b
leading to 10 × 32𝑘+4 − 5 × 22𝑘
𝑓(𝑘 + 1) = 5[2 × 32𝑘+4 − 22𝑘 ] − 𝑓(𝑘) o.e. A1 1.1b
If true for n = k then it is true for
n = k + 1 and as it is true for n = 1, the statement is true for all A1 2.4
(positive integers) n. (Allow ‘for all values’)
(6)
Way 5 f(k +1) – ‘M’f(k)
(Selecting a value of M that will lead to multiples of 5)
When n = 1, 32𝑛+4 − 22𝑛 = 729 − 4 = 725
B1 2.2a
(725 = 145 × 5)so the statement is true for n = 1
Assume true for n = k so 32𝑘+4 − 22𝑘 is divisible by 5 M1 2.4

𝑓(𝑘 + 1) − ′M'f(𝑘) = 32𝑘+6 − 22𝑘+2 − ′M' × 32𝑘+4 + ′M' × 22𝑘 M1 2.1

𝑓(𝑘 + 1) − ′M'f(𝑘) = (9 − ′M') × 32𝑘+4 − (4 − ′M') × 22𝑘 A1 1.1b

𝑓(𝑘 + 1) = (9 − ′M') × 32𝑘+4 − (4 − 'M') × 22𝑘 + 'M'f(𝑘) o.e. A1 1.1b

If true for n = k then it is true for
n = k + 1 and as it is true for n = 1, the statement is true for all A1 2.4
(positive integers) n. (Allow ‘for all values’)
(6)
(6 marks)
Notes
Way 1 f(k +1) – f(k)
B1: Shows the statement is true for n = 1. Needs to show f(1) =725and conclusion true for n = 1,
this statement can be recovered in their conclusion if says e.g. true for n = 1
M1: Makes an assumption statement that assumes the result is true for n = k. Assume (true for)
𝑛 = 𝑘 is sufficient. This mark may be recovered in their conclusion if they say e.g. if true for 𝑛 =
𝑘 then …etc
M1: Attempts f(k +1) – f(k) or equivalent work
A1: Achieves a correct simplified expression for f(k +1) – f(k)
A1: Achieves a correct expression for f(k +1) in terms of f(k)

MrFurtherMaths Resources 8 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

A1: Correct complete conclusion. This mark is dependent on all previous marks. It is gained by
conveying the ideas of all underlined points either at the end of their solution or as a narrative in
their solution.

Way 2 f(k +1)

B1: Shows the statement is true for n = 1. Needs to show f(1) =725and conclusion true for n = 1,
this statement can be recovered in their conclusion if says e.g. true for n = 1.
M1: Makes an assumption statement that assumes the result is true for n = k. Assume (true for)
𝑛 = 𝑘 is sufficient. This mark may be recovered in their conclusion if they say e.g. if true for 𝑛 =
𝑘 then …etc
M1: Attempts f(k +1)
A1: Correctly achieves either 9𝑓(𝑘)or 5 × 22𝑘 or either4𝑓(𝑘) or 5 × 32𝑘+4
A1: Achieves a correct expression for f(k +1) in terms of f(k)
A1: Correct complete conclusion. This mark is dependent on all previous marks. It is gained by
conveying the ideas of all underlined points either at the end of their solution or as a narrative in
their solution.

Way 3 f(k) = 5M
B1: Shows the statement is true for n = 1. Needs to show f(1) =725and conclusion true for n = 1,
this statement can be recovered in their conclusion if says e.g. true for n = 1.
M1: Makes an assumption statement that assumes the result is true for n = k. Assume (true for)
𝑛 = 𝑘 is sufficient. This mark may be recovered in their conclusion if they say e.g. if true for 𝑛 =
𝑘 then …etc
M1: Attempts f(k +1)
A1: Correctly achieves either45𝑀or 5 × 22𝑘 or either 20𝑀or 5 × 32𝑘+4
A1: Achieves a correct expression for f(k +1) in terms of M and 22𝑘 or M and 32𝑘+4
A1: Correct complete conclusion. This mark is dependent on all previous marks. It is gained by
conveying the ideas of all underlined points either at the end of their solution or as a narrative in
their solution.

Way 4 f(k +1) + f(k)

B1: Shows the statement is true for n = 1. Needs to show f(1) =725and conclusion true for n = 1,
this statement can be recovered in their conclusion if says e.g. true for n = 1
M1: Makes an assumption statement that assumes the result is true for n = k. Assume (true for)
𝑛 = 𝑘 is sufficient. This mark may be recovered in their conclusion if they say e.g. if true for 𝑛 =
𝑘 then …etc
M1: Attempts f(k +1) + f(k) or equivalent work
A1: Achieves a correct simplified expression for f(k +1) + f(k)
A1: Achieves a correct expression for 𝑓(𝑘 + 1) = 5[2 × 32𝑘+4 − 22𝑘 ] − 𝑓(𝑘)
A1: Correct complete conclusion. This mark is dependent on all previous marks. It is gained by
conveying the ideas of all underlined points either at the end of their solution or as a narrative in
their solution.
Notes continued
Way 5 f(k +1) – Mf(k) (Selects a suitable value for M which leads to divisibility of 5)
B1: Shows the statement is true for n = 1. Needs to show f(1) =725and conclusion true for n = 1,
this statement can be recovered in their conclusion if says e.g. true for n = 1
M1: Makes an assumption statement that assumes the result is true for n = k. Assume (true for)
𝑛 = 𝑘 is sufficient. This mark may be recovered in their conclusion if they say e.g. if true for 𝑛 =
𝑘 then …etc
M1: Attempts f(k +1) – Mf(k) or equivalent work

MrFurtherMaths Resources 9 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

A1: Achieves a correct simplified expression, 𝑓(𝑘 + 1) − ′M'f(𝑘)which is divisible by

5𝑓(𝑘 + 1) − ′M'f(𝑘) = (9 − ′M') × 32𝑘+4 − (4 − ′M') × 22𝑘
A1: Achieves a correct expression for 𝑓(𝑘 + 1) = (9 − ′M') × 32𝑘+4 − (4 − 'M') × 22𝑘 +
'M'f(𝑘)which is divisible by 5
A1: Correct complete conclusion. This mark is dependent on all previous marks. It is gained by
conveying the ideas of all underlined points either at the end of their solution or as a narrative in
their solution.

MrFurtherMaths Resources 10 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

4 When n = 1, 3𝑛 − 2𝑛 = 1
When n = 2, 3𝑛 − 2𝑛 = 9 − 4 = 5 B1 2.2a
So the result is true for n = 1 and n = 2
Assume true for n = k and n = k + 1 so
M1 2.4
𝑢𝑘 = 3𝑘 − 2𝑘 and 𝑢𝑘+1 = 3𝑘+1 − 2𝑘+1
𝑢𝑘+2 = 5(3𝑘+1 − 2𝑘+1 ) − 6(3𝑘 − 2𝑘 ) M1 1.1b
𝑢𝑘+2 = 5 × 3𝑘+1 − 5 × 2𝑘+1 − 2 × 3𝑘+1 + 3 × 2𝑘+1 A1 1.1b
= 3 × 3𝑘+1 − 2 × 2𝑘+1
A1 2.1
= 3𝑘+2 − 2𝑘+2
If the statement is true for n = k and n = k + 1then it has been shown
true for n = k + 2 and as it is true for n = 1 and n = 2, the statement is A1 2.4
true for all positive integers n.
(6)
(6 marks)
Notes
B1: Shows the statement is true for n = 1 and n = 2
M1: Makes a statement that assumes the result is true for n = k and n = k + 1
M1: Substitutes the assumption statements into the given result
A1: Correct expression that has been processed correctly to be in terms of 3k + 1 and 2k + 1
A1: Obtains 3𝑘+2 − 2𝑘+2 with no errors and all working shown
A1: Correct complete conclusion that may be part of a narrative throughout the proof

MrFurtherMaths Resources 11 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

5 When n = 1, 23𝑛+1 + 3(52𝑛+1 ) = 16 + 375 = 391

B1 2.2a
391 = 17 × 23 so the statement is true for n = 1

Assume true for n = k so 23𝑘+1 + 3(52𝑘+1 )is divisible by 17 M1 2.4

𝑓(𝑘 + 1) − 𝑓(𝑘) = 23𝑘+4 + 3(52𝑘+3 ) − 23𝑘+1 − 3(52𝑘+1 ) M1 2.1

= 7 × 23𝑘+1 + 7 × 3(52𝑘+1 ) + 17 × 3(52𝑘+1 )

= 7𝑓(𝑘) + 17 × 3(52𝑘+1 ) A1 1.1b

𝑓(𝑘 + 1) = 8𝑓(𝑘) + 17 × 3(52𝑘+1 ) A1 1.1b

If the statement is true for n = k then it has been shown true for
n = k + 1 and as it is true for n = 1, the statement is true for all positive A1 2.4
integers n
(6)
(6 marks)
Notes:
B1: Shows the statement is true for n = 1
M1: Assumes the statement is true for n = k
M1: Attempts f(k+1) – f(k)
A1: Correct expression in terms of f(k)
A1: Correct expression in terms of f(k)
A1: Obtains a correct expression for f(k + 1)
A1: Correct complete conclusion

MrFurtherMaths Resources 12 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

2
6(i) 𝑛 = 1, LHS = 2 × 4 = 8, RHS = (1)(1 + 1)(1 + 5) = 8
3
B1 2.2a
So the result is true for 𝑛 = 1

Assume true for 𝑛 = 𝑘

𝑘
2 M1 2.4
∑ 2𝑟(𝑟 + 3) = 𝑘(𝑘 + 1)(𝑘 + 5)
3
𝑟=1
𝑘+1
2
∑ 2𝑟(𝑟 + 3) = 𝑘(𝑘 + 1)(𝑘 + 5) + 2(𝑘 + 1)(𝑘 + 1 + 3) M1 1.1b
3
𝑟=1
2 2
= (𝑘 + 1)[𝑘 (𝑘 + 5) + 3(𝑘 + 4)] or (𝑘 + 1)[𝑘 2 + 8𝑘 + 12] A1 1.1b
3 3
2
= (𝑘 + 1)(𝑘 + 2)(𝑘 + 6) A1 2.1
3
If true for 𝒏 = 𝒌 then true for 𝒏 = 𝒌 + 𝟏 and as it is true for 𝒏 = 𝟏 the
A1 2.4
statement is true for all (positive integers) n
(6)
5 −8 1 5 −8 1 + 4(1) −8(1) 5 −8
(ii)(a) 𝑛 = 1, ( ) = ( );( )=( )
2 −3 2 −3 2(1) 1 − 4(1) 2 −3
B1 2.2a
So the result is true for 𝑛 = 1

5 −8 𝑘 1 + 4𝑘 −8𝑘
Assume true for 𝑛 = 𝑘 ( ) = ( ) M1 2.4
2 −3 2𝑘 1 − 4𝑘
5 −8 𝑘+1 1 + 4𝑘 −8𝑘 5 −8
( ) =( )( )
2 −3 2𝑘 1 − 4𝑘 2 −3
or M1 1.1b
𝑘+1
5 −8 5 −8 1 + 4𝑘 −8𝑘
( ) =( )( )
2 −3 2 −3 2𝑘 1 − 4𝑘
1 + 4𝑘 −8𝑘 5 −8
( )( )
2𝑘 1 − 4𝑘 2 −3
5(1 + 4𝑘) − 16𝑘 −8(1 + 4𝑘) − 3(−8𝑘)
= ( )
5(2𝑘) + 2(1 − 4𝑘) −8(2𝑘) − 3(1 − 4𝑘)
or A1 1.1b
5 −8 1 + 4𝑘 −8𝑘
( )( )
2 −3 2𝑘 1 − 4𝑘
5(1 + 4𝑘) − 8(2𝑘) 5(−8𝑘) − 8(1 − 4𝑘)
=( )
2(1 + 4𝑘) − 3(2𝑘) 2(−8𝑘) − 3(1 − 4𝑘)
1 + 4(𝑘 + 1) −8(𝑘 + 1)
( ) A1 2.1
2(𝑘 + 1) 1 − 4(𝑘 + 1)
If true for 𝒏 = 𝒌 then true for 𝒏 = 𝒌 + 𝟏 and as it is true for 𝒏 = 𝟏 the
A1 2.4
statement is true for all (positive integers) n
(6)

MrFurtherMaths Resources 13 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Either
(ii)(b)
det(𝐌𝑛 ) = (1 + 4𝑛)(1 − 4𝑛) − (−8𝑛)(2𝑛) = 1
M1 2.1
or

det(𝐌) = −15 + 16 = 1

Either
det(𝐌𝑛 ) = 1
or
A1 2.4
det(𝐌𝑛 ) = (det𝐌)𝑛 = 1

Therefore det(𝐌𝑛 ) is independent of n

(2)

(14 marks)

Notes:

(i)
B1: Shows that the result holds for 𝑛 = 1. Must see substitution in the RHS and LHS and reach 8
M1: Makes a statement that assumes the result is true for some value of n
M1: Set up sum with assumed formula 2(𝑘 + 1)(𝑘 + 1 + 3)
2
A1: Achieves a correct expression with a factor of (𝑘 + 1)
3
A1: Reaches a correct simplified expression with no errors and the correct unsimplified expression with a
2
factor of (𝑘 + 1) seen previously.
3
A1: Correct conclusion. This mark is dependent on all previous marks. It is gained by conveying the ideas of
all four bold points either at the end of their solution or as a narrative in their solution
(ii) (a)
5 −8
B1: Shows that the result holds for 𝑛 = 1. Must see substitution in the RHS and reach ( )
2 −3
M1: Makes a statement that assumes the result is true for some value of n
M1: Set up a matrix multiplication of the assumed result multiplied by the original matrix, either way round
A1: Achieves a correct unsimplified matrix
A1: Reaches a correct simplified matrix with no errors and the correct unsimplified matrix seen
previously.
A1: Correct conclusion. This mark is dependent on all previous marks. It is gained by conveying the ideas of
all four bold points either at the end of their solution or as a narrative in their solution.
(ii) (b)
M1: Finds the determinant of matrix 𝐌𝑛 or matrix M
A1: Shows that det(𝐌𝑛 ) = 1, therefore independent of n

MrFurtherMaths Resources 14 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

7 1 1 2
When𝑛 = 1lhs = (0 1 1)
0 0 1
1 2
1 1 (1 + 3 × 1) 1 1 2 B1 2.2a
rhs = ( 2 ) = (0 1 1)
0 1 1
0 0 1
0 0 1
So the statement is true for n = 1
1
1 1 2 𝑘 1 𝑘 (𝑘 2 + 3𝑘)
2
Assume true for n = k so (0 1 1) = (0 1 𝑘 ) M1 2.4
0 0 1 0 0 1
1 2
1 1 2 𝑘+1 1 𝑘 (𝑘 + 3𝑘) 1 1 2
(0 1 1) =( 2 ) (0 1 1) M1 1.1b
0 1 𝑘
0 0 1 0 0 1
0 0 1
1
1 𝑘 + 1 2 + 𝑘 + (𝑘 2 + 3𝑘)
=( 2 ) A1 1.1b
0 1 𝑘+1
0 0 1
1 2 5 1
2 + 𝑘 + (𝑘 + 3𝑘) = 2 + 𝑘 + 𝑘 2
2 2 2 A1 2.1
1 2 1 2
= (𝑘 + 5𝑘 + 4) = ((𝑘 + 1) + 3(𝑘 + 1))
2 2
If the statement is true for n = k then it has been shown true for
n = k + 1 and as it is true for n = 1, the statement is true for all A1 2.4
positive integers n.
(6)
(6 marks)
Notes
B1: Shows the statement is true for n = 1
M1: Makes a statement that assumes the result is true for n = k
M1: Attempts to multiply the correct matrices
A1: Correct matrix in terms of k
A1: Correct matrix in terms of k + 1 including sufficient explanation for the element at the top
right hand corner
A1: Correct complete conclusion

MrFurtherMaths Resources 15 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

4 −1 3×1+1 −1 4 −1
8(i) When n = 1, LHS = ( ), RHS = ( )=( ).
9 −2 9×1 1−3×1 9 −2 B1 2.2a
So the statement is true for n = 1
4 −1 𝑘 3𝑘 + 1 −𝑘 M1 2.4
Assume true for n = k, so ( ) =( )
9 −2 9𝑘 1 − 3𝑘
4 −1 𝑘+1 4 −1 3𝑘 + 1 −𝑘 3𝑘 + 1 −𝑘 4 −1 M1 2.1
Then ( ) =( )( ) or ( )( )
9 −2 9 −2 9𝑘 1 − 3𝑘 9𝑘 1 − 3𝑘 9 −2
4(3𝑘 + 1) − 9𝑘 −4𝑘 − (1 − 3𝑘) 4(3𝑘 + 1) − 9𝑘 −(3𝑘 + 1) + 2𝑘
=( ) or ( ) A1 1.1b
9(3𝑘 + 1) − 18𝑘 −9𝑘 − 2(1 − 3𝑘) 36𝑘 + 9(1 − 3𝑘) −9𝑘 − 2(1 − 3𝑘)
3(𝑘 + 1) + 1 −(𝑘 + 1)
=( ) A1 1.1b
9(𝑘 + 1) 1 − 3(𝑘 + 1)
Hence the result is true for n = k+1. Since it is true for n = 1, and if true for k = n then A1
2.4
true for n = k+1, thus by mathematical induction the result holds for all n ∈ ℕ cso
(6)

(ii) (a) 22 = 4 ≮4 = 22 OR 32 = 9 ≮ 8 = 23 OR 42 = 16 ≮ 16 = 24 B1 1.1b

(b) The statement 2k+1 < k2 is not true for all positive integers. B1 1.1b
(c) The statement in line 4 is true for positive integers k > 2 so the induction hypothesis is
M1 2.3
true for 𝑛 > 2. So the induction holds from any base case greater than 2.
Since the result is true for n = 5 as 52 = 25 < 32 = 25 and 2k +1 < k2 also true for k > 5 so
A1 2.4
the induction holds with base case n = 5.
But not true for n = 2, 3 or 4 as 22 = 4 ≮4 = 22 and 32 = 9 ≮ 8 = 23 and 42 = 16 ≮ 16 = 24.
A1 2.1
Hence true for n = 1 and for 𝑛 ⩾ 5
(5)
(11 marks)
Notes:
(a)
B1: Shows the general form holds for n = 1.
M1: Makes the inductive assumption, assume true for n = k.
M1: Attempts the multiplication either way.
A1: Correct matrix in terms of k.
A1: Rearranged into correct form to show true for k + 1.
A1: Completes the inductive argument conveying all three underlined points or equivalent at some point in their
argument.
(b)(i)
B1: Provides a suitable counter example using n = 2, 3 or 4. Accept = in place of ≮ as long as there is a suitable
conclusion with it.
(b)(ii)
B1: Identifies the error as in the scheme or equivalent (e.g. k2 + 2k + 1 < 2k2 is not always true).
(b)(iii)
M1: Identifies that the induction is valid as long as 2k+1 < k2 is true which happens for 𝑘 ⩾ 3 (accept any value
greater than 3 for this mark).

MrFurtherMaths Resources 16 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

A1: Correct base case of 5 and explains the proof given holds for integers greater than or equal to 5.
A1: Complete argument correct. All positive integers satisfying the inequality identified, with demonstration that
2, 3 and 4 do not.

MrFurtherMaths Resources 17 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

9(i) When n = 1, ∑1𝑟=1(3𝑟 + 1) (𝑟 + 2) = 4 × 3 = 12

B1 2.2a
1(1 + 2)(1 + 3) = 12so the statement is true for n = 1
Assume true for n = k so ∑𝑘𝑟=1(3𝑟 + 1) (𝑟 + 2) = 𝑘(𝑘 + 2)(𝑘 + 3) M1 2.4
𝑘+1

∑(3𝑟 + 1) (𝑟 + 2) = 𝑘(𝑘 + 2)(𝑘 + 3) + (3𝑘 + 4)(𝑘 + 3) M1 2.1

𝑟=1

= (𝑘 + 3)(𝑘 2 + 5𝑘 + 4) A1 1.1b
𝑘+1

∑(3𝑟 + 1) (𝑟 + 2) = (𝑘 + 1)(𝑘 + 1 + 2)(𝑘 + 1 + 3) A1 1.1b

𝑟=1
If the statement is true for n = k then it has been shown true for
n = k + 1 and as it is true for n = 1, the statement is true for all A1 2.4
positive integers n.
(6)
(ii) When n = 1, 41 + 51 + 61 = 15
Way 1 B1 2.2a
so the statement is true for n = 1
Assume true for n = k so 4𝑘 + 5𝑘 + 6𝑘 is divisible by 15 M1 2.4
𝑓(𝑘 + 2) = 4𝑘+2 + 5𝑘+2 + 6𝑘+2 M1 2.1
= 16 × 4𝑘 + 16 × 5𝑘 + 16 × 6𝑘 + 9 × 5𝑘 + 20 × 6𝑘 A1 1.1b
= 16𝑓(𝑘) + 45 × 5𝑘−1 + 120 × 6𝑘−1 A1 1.1b
If true for n = k then true for n = k + 2, true for n = 1 so true for all
A1 2.4
(positive odd integers) n
(6)
1 1 1
(ii) When n = 1, 4 + 5 + 6 = 15
Way 2 B1 2.2a
so the statement is true for n = 1
Assume true for n = k so 4𝑘 + 5𝑘 + 6𝑘 is divisible by 15 M1 2.4
𝑓(𝑘 + 2) − 𝑓(𝑘) = 4𝑘+2 + 5𝑘+2 + 6𝑘+2 − 4𝑘 − 5𝑘 − 6𝑘 M1 2.1
= 15 × 4𝑘 + 24 × 5𝑘 + 35 × 6𝑘
A1 1.1b
= 15𝑓(𝑘) + 45 × 5𝑘−1 + 120 × 6𝑘−1
𝑓(𝑘 + 2) = 16𝑓(𝑘) + 45 × 5𝑘−1 + 120 × 6𝑘−1 A1 1.1b
If true for n = k then true for n = k + 2, true for n = 1 so true for all
A1 2.4
(positive odd integers) n
(6)
(12 marks)
Notes
(i)
B1: Shows the statement is true for n = 1
M1: Makes an assumption statement that assumes the result is true for n = k
M1: Attempts to add the (k + 1)th term to the assumed result
A1: Correct expression with at least one correct linear factor
A1: Obtains a fully correct expression in terms of k + 1

MrFurtherMaths Resources 18 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

A1: Correct complete conclusion with all ideas conveyed at the end or as a narrative
(ii) Way 1
B1: Shows that f(1) = 15
M1: Makes a statement that assumes the result is true for some value of n (Assume (true for)
n = k is sufficient – note that this may be recovered in their conclusion if they say e.g. if true for
n = k then … etc.)
M1: Attempts f(k + 2)
A1: Correctly obtains 16f(k) or 45 × 5𝑘−1 + 120 × 6𝑘−1
A1: Reaches a correct expression for f(k + 2) in terms of f(k)
A1: Correct conclusion. This mark is dependent on all previous marks apart from the B mark. It is
gained by conveying the ideas of all four underlined points either at the end of their solution or
as a narrative in their solution.
Way 2
B1: Shows that f(1) = 15
M1: Makes a statement that assumes the result is true for some value of n (Assume (true for)
n = k is sufficient – note that this may be recovered in their conclusion if they say e.g. if true for
n = k then … etc.)
M1: Attempts f(k + 2) – f(k) or equivalent work
A1: Achieves a correct expression for f(k + 2) – f(k) in terms of f(k)
A1: Reaches a correct expression for f(k + 2) in terms of f(k)
A1: Correct conclusion. This mark is dependent on all previous marks apart from the B mark. It is
gained by conveying the ideas of all four underlined points either at the end of their solution or
as a narrative in their solution.

MrFurtherMaths Resources 19 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

1 1 1 𝑛 1 1
𝑛= 1, ∑1𝑟=1 = = and = = (true
10 (2𝑟−1)(2𝑟+1) 1×3 3 2𝑛+1 2×1+1 3 B1 2.2a
for n=1)
Assume general statement is true for 𝑛 = 𝑘.
So assume ∑𝑘𝑟=1
1
=
𝑘
is true. M1 2.4
(2𝑟−1)(2𝑟+1) 2𝑘+1
 k +1 1 " k " 1
 =  + M1 2.1
 r = 1 (2r − 1)(2r + 1)  2k + 1 (2k + 1)(2k + 3)
𝑘(2𝑘+3)+1
= dM1 1.1b
(2𝑘+1)(2𝑘+3)
2𝑘 2 +3𝑘+1 (2𝑘+1)(𝑘+1) (𝑘+1) 𝑘+1
= = = or A1 1.1b
(2𝑘+1)(2𝑘+3) (2𝑘+1)(2𝑘+3) 2(𝑘+1)+1 2𝑘+3
𝑘+1 1 (𝑘+1)
As ∑𝑟=1 = then the general result is true for
(2𝑟−1)(2𝑟+1) 2(𝑘+1)+1
n=k +1
As the general result has been shown to be truefor𝑛 = 1, and A1cso 2.4
true for n = k implies true for n = k + 1, so the result is true for
all n ∈ ℕ
(6)
(6 marks)
Notes
B1 Substitutes 𝑛 = 1 into both sides of the statement to show they are eqaul. As
1 1
a minimum expect to see and for the substitutions. (No need to state
1×3 2+1
true for n = 1 for this mark.)
M1 Assumes (general result) true for 𝑛 = 𝑘. (Assume (true for) n = k is sufficient
– note that this may be recovered in their conclusion if they say e.g. if true for
n = k then ... etc.)
M1 Attempts to add (𝑘 + 1)th term to their sum of k terms. Must be adding the
(k+1)th term but allow slips with the sum.
dM1 Depends on previous M. Combines their two fractions over a correct common
denominator for their fractions, which may be (2𝑘 + 1)2 (2𝑘 + 3) (allow a
slip in the numerator).
(𝑘+1) 𝑘+1
A1 Correct algebraic work leading to 2(𝑘+1)+1 or 2𝑘+3
A1 cso Depends on all except the B mark being scored (but must have an attempt
to show the n = 1 case). Demonstrates the expression is the correct for n = k +
1 (both sides must have been seen somewhere) and gives a correct induction
statement with all three underlined statements (or equivalents) seen at some
stage during their solution (so true for n = 1 may be seen at the start).
(𝑘+1)
For demonstrating the correct expression, accept giving in the form ,
2(𝑘+1)+1
𝑘+1
or reaching and stating “which is the correct form with n = k + 1” or
2𝑘+3
similar – but some indication is needed.

Note: if mixed variables are used in working (r’s and k’s mixed up) then
withhold the final A.
Note: If n is used throughout instead of k allow all marks if earned.

MrFurtherMaths Resources 20 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

11(a) For n = 1 : f (1) = 15 + 4(1) = 5 . So the statement is true for n = 1 B1 2.2a

Assume true for n = k…1 , so k 5 + 4k is divisible by 5 M1 2.4

f (k + 1) = (k + 1)5 + 4(k + 1) = k 5 + 5k 4 + M1 2.1

= 𝑘 5 + 5𝑘 4 + 10𝑘 3 + 10𝑘 2 + 5𝑘 + 1 + 4𝑘 + 4 A1 1.1b

= 𝑘 5 + 4𝑘 + 5(𝑘 4 + 2𝑘 3 + 2𝑘 2 + 𝑘 + 1)
A1 1.1b
= 𝑓(𝑘) + 5(𝑘 4 + 2𝑘 3 + 2𝑘 2 + 𝑘 + 1)
Hence the result is true for n = k + 1 . Since it is true for n = 1 , and if
true for n = k then true for n = k + 1 , thus by mathematical induction A1cso 2.4
+
the result holds for all n 

(6)

(b) For any x , f (− x) = ( (− x)5 + 4(− x) = ) − x5 − 4 x = −( x5 + 4 x) = −f ( x) * B1* 2.5

(1)

(c) We know from (a) that f (n) is divisible 5 for all positive integers,
and since by (b) for negative n we have f (n) = −f (−n) is divisible M1 2.1
by 5 (as − n is a positive integer).
Since f (0) = 0 is also divisible by 5, so f (n) is divisible by 5 for all
A1 2.4
integers n .
(2)

(9 marks)

Notes:
(a)
B1: Shows the statement is true for n = 1 .
M1: Makes the inductive assumption, assume true for n = k .
M1: Attempts to expand f (k + 1) or f (k + 1) − f (k ) using the binomial theorem.
A1: Correct expansion.
A1: Correct expression for f (k + 1) with common factor 5 made clear.
A1: Completes the inductive argument conveying all three underlined points or equivalent at some
point in their argument.
(b)
B1*: Correct proof with each of the un-bracketed expressions shown in the scheme.
(c)
M1: Reasons that result holds for negative integers by results of (a) and (b).

MrFurtherMaths Resources 21 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

A1t: Considers the n = 0 case and concludes true for all integers. Note: if n = 0 case was used as
the inductive base in (a), the reasoning here must clearly refer to all integers for the mark to be
awarded.

Question Scheme Marks AOs

12(a) 1
𝑛 = 1,lhs = 1(2)(3) = 6,rhs = (1)(2)2 (3) = 6
2 B1 2.2a
(true for n = 1)
1
Assume true for n = k so ∑𝑘𝑟=1 𝑟(𝑟 + 1) (2𝑟 + 1) = 𝑘(𝑘 +
2 M1 2.4
2 (𝑘
1) + 2)
𝑘+1

∑ 𝑟(𝑟 + 1) (2𝑟 + 1)
𝑟=1
1 M1 2.1
= 𝑘(𝑘 + 1)2 (𝑘 + 2)
2
+ (𝑘 + 1)(𝑘 + 2)(2𝑘 + 3)
1
= (𝑘 + 1)(𝑘 + 2)[𝑘(𝑘 + 1) + 2(2𝑘 + 3)] dM1 1.1b
2
1
= (𝑘 + 1)(𝑘 + 2)[𝑘 2 + 5𝑘 + 6]
2
1
= (𝑘 + 1)(𝑘 + 2)(𝑘 + 2)(𝑘 + 3)
2
1 2
Shows that = (𝑘 + 1)(𝑘 + 1 + 1) (𝑘 + 1 + 2)
2
1
Alternatively shows that ∑𝑘+1
𝑟=1 𝑟(𝑟 + 1) (2𝑟 + 1) = (𝑘 +
A1 1.1b
2
1)(𝑘 + 1 + 1)2 (𝑘 + 1 + 2)
1
= (𝑘 + 1)(𝑘 + 2)2 (𝑘 + 3)
2
Compares with their summation and concludes true for n = k +1,
may be seen in the conclusion.
If the statement is true for n = k then it has been shown true for
n = k + 1 and as it is true for n = 1, the statement is true for all A1 2.4
positive integers n.
(6)
(b) 2𝑛

∑ 𝑟(𝑟 + 1) (2𝑟 + 1)
𝑟=𝑛
1 M1 3.1a
= (2𝑛)(2𝑛 + 1)2 (2𝑛 + 2)
2
1
− (𝑛 − 1)𝑛2 (𝑛 + 1)
2
1
= 𝑛(𝑛 + 1)[4(2𝑛 + 1)2 − 𝑛(𝑛 − 1)] M1 1.1b
2

MrFurtherMaths Resources 22 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

1
= 𝑛(𝑛 + 1)(15𝑛2 + 17𝑛 + 4)
2 A1 1.1b
1
= 𝑛(𝑛 + 1)(3𝑛 + 1)(5𝑛 + 4)
2
(3)
(9 marks)
Notes
(a) Note ePen B1 M1 M1 A1 A1 A1
B1: Substitutes n = 1 into both sides to show that they are both equal to 6. (There is no need to
state true for n = 1 for this mark)
M1: Makes a statement that assumes the result is true for some value of n, say k
M1: Adds the (k + 1)th term to the assumed result
1
dM1: Dependent on previous M, factorises out 2 (𝑘 + 1)(𝑘 + 2)
A1: Reaches a correct the required expression no errors and shows that this is the correct sum for
n = k +1
A1: Depends on all except B mark being scored (must have been some attempt to show true for n
= 1). Correct conclusion conveying all the points in bold.
(b)
M1: Realises that ∑2𝑛 𝑛−1
𝑟=1 𝑟(𝑟 + 1) (2𝑟 + 1) − ∑𝑟=1 𝑟(𝑟 + 1) (2𝑟 + 1) is required and uses the
result from part (a) to obtain the required sum in terms of n
1
M1: Attempts to factorise by 2 𝑛(𝑛 + 1)
A1: Correct expression or correct values

MrFurtherMaths Resources 23 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

1 − 6 1 9 1   −5 9   −5 9 
1
13
For n = 1 :  = = 
 −4 1 1 + 6 1  −4 7   −4 7  B1 2.2a
So the statement is true for n = 1
Assume true for n = k ,
or
M1 2.5
 −5 9  1 − 6k 9k 
k

Assume   = 
 −4 7   −4k 1 + 6k 
k +1
 −5 9   −5 9   −5 9   −5 9   −5 9 
k k

  =    OR    M1 2.1
 −4 7   −4 7   −4 7   −4 7   −4 7 
 1 − 6k 9k   −5 9   −5 + 30k − 36k 9 − 54k + 63k 
=  = 
 −4k 1 + 6k   −4 7   20k − 4 − 24k −36k + 7 + 42k 
OR M1 1.1b
 −5 9  1 − 6k 9k   −5 + 30k − 36k −45k + 9 + 54k 
=  = 
 −4 7   −4k 1 + 6k   −4 + 24k − 28k −36k + 7 + 42k 

 −5 − 6k 9 + 9k 
Achieves from fully correct working =   A1 1.1b
 −4 − 4k 7 + 6k 
1 − 6(k + 1) 9(k + 1) 
= 
 −4(k + 1) 1 + 6(k + 1) 
Hence the result is true for n = k + 1 . Since it is true for n = 1 , and if true A1cso 2.4
for n = k then true for n = k + 1 , thus by mathematical induction the
result holds for all n 
(6)

(6 marks)

MrFurtherMaths Resources 24 www.mrfurthermaths.com

 MrFurtherMaths
ALL QUESTIONS IN THIS DOCUMENT ARE FROM EDEXCEL PAPERS

Question Scheme Marks AOs

n
14  1 −2   1 −2n 
  =  
0 1  0 1 
1
 1 −2   1 −2 1
  =   (so true when n = 1) B1 2.2a
 0 1   0 1 
(Assume true for n = k, then)
k +1
 1 −2   1 −2  1 −2k   1 −2k  1 −2  M1 2.1
  =  
 0 1   or 
 0 1  0 1 
 0 1   0 1     
 1 −2k − 2   1 −2 − 2k 
=  or =   A1 1.1b
0 1  0 1
   

=
(
 1 −2 k + 1
)  A1 2.2a
0 1 
 
Hence result is true for n = k +1. As true for n = 1 and have shown if
A1 2.5
true for n = k then it is true for n = k +1, so it is true for all n.
(5)

(5 marks)

MrFurtherMaths Resources 25 www.mrfurthermaths.com