1.

Using mathematical induction, prove that the number 2 3n 1 is divisible by 9, for n = 1, 2, ..... .
(Total 7 marks)

2n

2.

Let S(n) be the statement: 2 3n 1 is divisible by 9. 2 Since 2 3 1 = 0, S(1) is true. Assume as the induction hypothesis S(k) ie 2 3k 1 is divisible by 9. We shall show that S(k + 1) is true. 2(k+l) S(k + 1) = 2 3(k + 1) 1 2k = 4(2 ) 3k 4 2k = 9(2 3k 1) + 9k By the induction hypothesis 2 3k 1 is divisible by 9. Since 9k is also divisible by 9, S(k + 1) is true. Thus, by mathematical induction S(n) is true, n = 1, 2, ...
2k 2k

2n

(C1) (C1) (M1) (M1) (A1) (M1) (R1)

[7]

3. (b) (c)

(a)

Evaluate (1 + i) , where i =

1 .
(2)
4n n

Prove, by mathematical induction, that (1 + i) = (4) , where n Hence or otherwise, find (1 + i) .

32

*.
(6)

(2) (Total 10 marks)

4.

(a)

(1 + i) = 1 + 2i + i = 2i (A1) 2

(M1)

(b)

(1 + i) 4n n Let P(n) be the proposition: (1 + i) = (4) We must first show that P(1) is true. 4 2 2 2 (1 + i) = ((1 + i) ) = (2i) 2 1 = 4(i) = (4) Next, assume that for some k P(k) is true, then show that P(k +1) is true. 4k k P(k):(1 + i) = (4) 4(k+1) 4k 4 Now, (1 + i) = (1 + i) (1 + i) k = (4) (4) (M1) k+1 = (4) (A1) Therefore, by mathematical induction P(n) is true for all n 6
32 4(8) 8 +

4n

(M1) (A1) (C1)

(C1)

(c)

(1 + i) = (1 + i) = (4) = 65536

(M1) (A1)

2
[10]

5.

d n n1 Prove by mathematical induction that dx (x ) = nx , for all positive integer values of n.

(Total 10 marks)

6.

d n n1 Let pn be the statement dx (x ) = nx for all positive integer values of n. (x + k) x d lim k dx (x1) = k 0 If n = 1 then
=1 0 = 1x (A1)

(M1)(A1)

d k k1 Assume the formula is true for n = k, that is, dx (x ) = kx . d d dx (xk+1) = dx (x xk) Then
= kx x + x (using the results for n = k and n = 1 given above) k = x (k + 1) which is the formula when n = k + 1 So if the formula is true for n = k then it is true for n = k + 1. p1 is true, so p2 is true and p3 is true, therefore pn is true for all integer value of n.
k1 k

(M1) (M1) (M1)(A1) (A1) (R1) (R1) 10

[10]

7.

dn n (cos x ) = cos x + , n 2 for all positive integer Using mathematical induction, prove that dx values of n.
(Total 7 marks)

8.

dn n cos x = cos x + n 2 for all positive integer values of n. Let pn be the statement dx d For n = 1, dx (cos x) = sin x (A1) cos x + 2 = (A1) Therefore p1 is true. Assume the formula is true for n = k, dk k (cos x) = cos x + k 2 that is, dx

(M1)

 d d dk k dx k (cos x) = dx cos x + 2 dx Then d k +1 kx (cos x) = sin x + k +1 2 dx d kx (cos x) = cos x + + k +1 2 2 dx d k +1 (k + 1) (cos x) = cos x + k +1 2 dx which is pn when n = k + 1. (So if pn is true for n = k then it is true for n = k + 1 and by the principle of mathematical induction pn is true for all positive integer values of n.)
k +1

(M1) (A1) (A1)

(R1)
[7]

9.

Consider the sequence {an} = {1, 1, 2, 3, 5, 8, 13,...} where a1 = a2 = 1 and an+1 = an + an1 for all integers n 2.
1 1 , Given the matrix Q = 1 0 use the principle of mathematical induction a n +1 a n an an 1 n for all integers n 2. to prove that Q =

(Total 7 marks)

10.

a n +1 a n a n n a n 1 . Let P(n) be the proposition: Q = 1 1 1 1 2 1 a 3 1 0 1 0 = 1 1 = a 2 2 P(2) is true since Q =

a2 a1 . ak a k 1
.

(M1)(C1) (M1)

a k +1 a k Assume P(k) is true for some integer k 2, that is Q = k

1 1 a k +1 a k 1 0 a k+1 k k a k 1 Then, Q = QQ = a k +1 + a k a k + a k 1 a ak k +1 = a k + 2 a k +1 a k +1 a k (C1) = Therefore, P(k) is true P(k + 1) is true, and so P(n) is true for all integers n 2.

(M1) (C1)

(R1)
[7]

11.

(a)

Prove using mathematical induction that 2 n 1 1

n n 2 1 = 2 0 1 0

, for all positive integer values of n.

(5)

(b)

Determine whether or not this result is true for n = 1.

(2) (Total 7 marks)

12.

(a) Thus true for n = 1. Assume true for n = k, that is,

2 1 2 1 21 0 1 = 0 1 = 0 Let n = 1,
k

21 1 1

(A1)

2 1 2 k 0 1 = 0
Consider

2 k 1 1 2k 1 2 1 2k +1 = 1 0 1 0 2k +1 1 1

(M1)

2 1 0 1

k +1

2k = 0

True for k true for k +1. (Or some correct concluding statement.) 5

(M1)(A1) (A1)

(b)

2 1 0 1 A=
2 1 0
2

n = 1

1 2 1 2 1 1 1 1 =2 2 1 0 1 = A1

1 2 0 1 A =

(A1)

(R1)
[7]

13.

2 1 The matrix M is defined as M = 1 0 .

(a) (b)

Find M , M and M .
(3)

(i) (ii)

State a conjecture for M , ie express M in terms of n, where n

Prove this conjecture using mathematical induction.

(7) (Total 10 marks)

14.

3 2 2 1 2 (a) M = 4 3 3 2 3 M = 5 4 4 3 4 M =
3

(A1) (A1) (A1)

(b)

n +1 n n 1 n n for n M =

(C1)

n +1 n n 1 n n Let P(n) be the statement M = 1 + 1 1 1 1 1 1 M = (M1) 2 1 1 0 =

Therefore, P(1) is true. (AG)

k +1 k k 1 k k Assume P(k) is true, ie M =

M
k+1

(M1)

=M

k.

k + 1 k 2 1 k 1 k 1 0 = 2k + 2 k k 1 2k + 1 k k = = n +1 n n 1 n n , n M = ( k + 1) + 1 k +1

(M1) (A1) (A1)

( k + 1) 1 ( k + 1)

Therefore, the truth of P(k) implies the truth of P(k + 1). So by the induction hypothesis
+

(R1) 7
[10]

15.

(a)

Use mathematical induction to prove that (1)(1!) + (2)(2!) + (3)(3!) + ...+ (n)(n!) = (n +1)!1 where n
+

.
(8)
9

(b)

Find the minimum number of terms of the series for the sum to exceed 10 .
(3) (Total 11 marks)

16.

(a) If n = 1, then (1)(1!) = (1+1)! 1 is true Assume true for n = k (1)(1!) + (2)(2!) +...+ (k)(k !) = (k + 1) ! 1 Add the next term (k + 1)(k + 1)! to both sides (1)(1!) + (2)(2!) +...+ (k)(k!) + (k + 1)(k + 1)! = (k + 1)! + (k + 1)(k + 1)! 1 = (k + 1)![1 + k + 1] 1 A1 = (k + 2)! 1 A1 True for k True for k + 1 and since true for n = 1, result proved by mathematical induction. (b) (n + 1)! 1 > 1000000000 (n + 1)! > 1000000001 from GDC minimum value of n = 12 N3

A1 M1A1 M1 A1

R1 (M1) A2
[11]