- 1
Let Sn=∑r=1nr(r+1) for positive integers n. A student is proving by induction that Sn=3n(n+1)(n+2). (a)Find the value of S4. [1 mark] - A20
- B40
- C30
- D120
Show the mark scheme
(b)Assume the result is true for n=k. Which expression is Sk+1 before any simplification? [1 mark] - A3k(k+1)(k+2)+(k+1)(k+2)
- B3k(k+1)(k+2)+k(k+1)
- C3(k+1)(k+2)(k+3)+(k+1)(k+2)
- D3k(k+1)(k+2)+(k+1)
Show the mark scheme
(c)Show that 3k(k+1)(k+2)+(k+1)(k+2)=3(k+1)(k+2)(k+3). [2 marks] Show the mark scheme
Mark scheme
M1: factorises (k+1)(k+2) out, giving (k+1)(k+2)(3k+1), or uses a common denominator of 3
A1: 3k+1=3k+3 seen, leading to 3(k+1)(k+2)(k+3)
AG Total for question 1: 4 marks
- 2
For positive integers n, let Tn=∑r=1nr(r+1)1. It is to be proved by induction that Tn=n+1n. (a)Find the value of T3. [1 mark] - A1211
- B121
- C43
- D34
Show the mark scheme
(b)Assume the result is true for n=k. Which expression equals k+1k+(k+1)(k+2)1? [1 mark] - Ak+21
- Bk+3k+2
- C(k+1)(k+2)k2+1
- Dk+2k+1
Show the mark scheme
(c)Write down the basis step for n=1 and state the inductive hypothesis. [2 marks] Show the mark scheme
Mark scheme
B1: n=1: LHS =1×21=21 and RHS =1+11=21, so true for n=1
B1: assume true for n=k: ∑r=1kr(r+1)1=k+1k
Accept: 'assume Tk=k+1k'
Do not accept: assuming the result for n=k+1 Total for question 2: 4 marks
- 3
The sequence un is defined by u1=3 and un+1=3un−2 for n≥1. A student suggests that un=2×3n−1+1. (a)Find u2, u3 and u4, and show that the suggested formula gives the correct value of u4. [3 marks] Show the mark scheme
Mark scheme
M1: uses the recurrence, e.g. u2=3(3)−2
A1: u2=7 and u3=19
A1: u4=55, and 2×33+1=55 shown (b)Prove by induction that un=2×3n−1+1 for all positive integers n. [4 marks] Show the mark scheme
Mark scheme
B1: n=1: 2×30+1=3=u1, so true for n=1
M1: assumes uk=2×3k−1+1 and uses uk+1=3uk−2=3(2×3k−1+1)−2
A1: =2×3k+3−2=2×3k+1
A1: this is the formula with n=k+1; true for n=1 and true for n=k implies true for n=k+1, so true for all positive integers n by induction
Accept: equivalent wording of the conclusion Total for question 3: 7 marks
- 4
For positive integers n, let An=∑r=1nr2 and Bn=∑r=1nr3. (a)Prove by induction that An=61n(n+1)(2n+1) for all positive integers n. [6 marks] Show the mark scheme
Mark scheme
B1: n=1: LHS =1 and RHS =61×2×3=1, so true for n=1
M1: assumes true for n=k and adds the next term: Ak+1=61k(k+1)(2k+1)+(k+1)2
A1: factorises: 6k+1[k(2k+1)+6(k+1)]
A1: =6(k+1)(2k2+7k+6)
A1: =6(k+1)(k+2)(2k+3), which is the formula with n=k+1
A1: conclusion: true for n=1, and true for n=k implies true for n=k+1, so true for all positive integers n by induction (b)Prove by induction that Bn=41n2(n+1)2 for all positive integers n. [6 marks] Show the mark scheme
Mark scheme
B1: n=1: LHS =1 and RHS =41×4=1, so true for n=1
M1: assumes true for n=k and adds the next term: Bk+1=41k2(k+1)2+(k+1)3
A1: factorises: 41(k+1)2[k2+4(k+1)]
A1: =41(k+1)2(k+2)2, using k2+4k+4=(k+2)2
A1: this is the formula with n=k+1
A1: conclusion: true for n=1, and true for n=k implies true for n=k+1, so true for all positive integers n by induction Total for question 4: 12 marks
End of questions