- 1
Proof by mathematical induction is used to show that ∑r=1nr(r+1)1=n+1n for all positive integers n. (a)What is the value of each side of the identity when n=1? [1 mark] - A1
- B21
- C31
- D2
Show the mark scheme
(b)Assuming the result is true for n=k, which expression is equal to the sum of the first k+1 terms? [1 mark] - Ak+1k+k(k+1)1
- Bk+2k+1+(k+1)(k+2)1
- Ck+1k+(k+1)(k+2)1
- Dk+1k+k+21
Show the mark scheme
(c)Show that if the result is true for n=k then it is true for n=k+1. [2 marks] Show the mark scheme
Mark scheme
M1: common denominator, e.g. (k+1)(k+2)k(k+2)+1 or (k+1)(k+2)k(k+2)+(k+1)(k+2)1
A1: (k+1)(k+2)(k+1)2=k+2k+1, which is the formula with n=k+1
Accept: a stated target of (k+1)+1k+1 Total for question 1: 4 marks
- 2
Let f(n)=7n+5, where n is a positive integer. (a)Find f(2). [1 mark] - A54
- B19
- C24
- D49
Show the mark scheme
(b)Which expression is equal to f(k+1)−f(k)? [1 mark] - A7k
- B8×7k
- C7k+1+5
- D6×7k
Show the mark scheme
(c)Given that f(k) is divisible by 6 for some positive integer k, show that f(k+1) is also divisible by 6. [2 marks] Show the mark scheme
Mark scheme
M1: f(k+1)=7⋅7k+5 with 7k=6m−5 substituted (or f(k+1)−f(k)=6×7k)
A1: f(k+1)=42m−30=6(7m−5), or f(k+1)=f(k)+6×7k, a multiple of 6 with a statement saying so Total for question 2: 4 marks
- 3
The matrix A=(2011). (a)Find A2 and A3, and hence suggest a formula for An. [3 marks] Show the mark scheme
Mark scheme
M1: attempt at A2, giving (4031)
A1: A3=(8071)
B1: An=(2n02n−11)
Accept: the formula written in any equivalent form (b)Prove by induction that your formula for An is correct for all positive integers n. [4 marks] Show the mark scheme
Mark scheme
B1: true for n=1: (21021−11)=(2011)=A
M1: assume true for n=k and form Ak+1=AkA (or AAk)
A1: (2k+102k+2k−11)=(2k+102k+1−11)
A1: conclusion: true for n=1, and if true for n=k then true for n=k+1, so true for all positive integers n
Accept: either order of multiplication Total for question 3: 7 marks
- 4
In this question you must use proof by mathematical induction, stating the assumption made at the inductive step and ending with a clear conclusion. n is a positive integer. (a)Prove that ∑r=1nr(r+2)=6n(n+1)(2n+7). [6 marks] Show the mark scheme
Mark scheme
B1: n=1: LHS =3 and RHS =61×2×9=3
M1: assume true for n=k and add the (k+1)th term, 6k(k+1)(2k+7)+(k+1)(k+3)
M1: factor out 6k+1, giving 6k+1[k(2k+7)+6(k+3)]
A1: 6(k+1)(2k2+13k+18)
A1: 6(k+1)(k+2)(2k+9), which is the formula with n=k+1
A1: conclusion: true for n=1, and if true for n=k then true for n=k+1, so true for all positive integers n (b)Prove that 2n+2+32n+1 is divisible by 7. [6 marks] Show the mark scheme
Mark scheme
B1: n=1: 23+33=35=7×5, divisible by 7
M1: assume f(k)=2k+2+32k+1 is divisible by 7, e.g. =7m
M1: f(k+1)=2k+3+32k+3=2⋅2k+2+9⋅32k+1
A1: f(k+1)−2f(k)=7⋅32k+1, or f(k+1)=2(7m−32k+1)+9⋅32k+1
A1: f(k+1)=14m+7⋅32k+1=7(2m+32k+1), a multiple of 7
A1: conclusion: true for n=1, and if true for n=k then true for n=k+1, so true for all positive integers n
Accept: other valid combinations, e.g. f(k+1)−9f(k)=−7⋅2k+2 Total for question 4: 12 marks
End of questions