Past Paper Questions 1. Using mathematical induction, prove that the number 22n 3n 1 is divisible by 9, for n = 1, 2, ..... . 2.

2. (a) The function f is defined by (i) Find the minimum value of f. (ii) Prove that ex 1 + x for all real values of x. (b) Use the principle of mathematical induction to prove that for all integers n 1. (c) Use the results of parts (a) and (b) to prove that > n.

(d) Find a value of n for which > 100 3. Use mathematical induction to prove that 5n + 9n + 2 is divisible by 4, for n +. 4. (a) Show that cos(A + B) + cos(A B) = 2 cosAcosB (b) Let Tn(x) = cos(n arccosx) where x is a real number, x [1, 1] and n is a positive integer. (i) Find T1(x). (ii) Show that T2(x) = 2x2 1. (c) (i) Use the result in part (a) to show that Tn+1(x) + Tn 1(x) = 2xTn(x).

(ii) Hence or otherwise, prove by induction that Tn(x) is a polynomial of degree n.

Answers 1. Let S(n) be the statement: 22n 3n 1 is divisible by 9.Since 22 3 1 = 0, S(1) is true. (C1) Assume as the induction hypothesis S(k) i.e. 22k 3k 1 is divisible by 9. (C1) We shall show that S(k + 1) is true. S(k + 1) = 22(k+l) 3(k + 1) 1 (M1)= 4(22k) 3k 4 (M1)= 9(22k 3k 1) + 9k (A1)

By the induction hypothesis 22k 3k 1 is divisible by 9.Since 9k is also divisible by 9, S(k + 1) is true. (M1)Thus, by mathematical induction S(n) is true, n = 1, 2, ... (R1) [7] 2. (a) (i)f(x) = ex 1 x f(x) = ex 1 = 0 when x = 0(M1)f(0) = 1 > 0 and so the minimum value of f(x) = f(0) = 0(A1) Alternatively The graph of y = f(x) is as follows: The minimum value of f(x) is 0 (A2) (ii) From part (i), f(x) 0 for all x (M1)(R1) x 1 x 0 e

(A1) x 1 + x e (AG) (b) Let P(n) be the proposition: (1 + 1) = n + 1 (M1) P(1) is true since (1 + 1) = 2 and n + 1 = 2 when n = 1 (M1)Assume P(k) is true for some integer k 1.That is, (1 + 1) = k + 1 (M1)Then, (1 + 1)= (k + 1) (M1)= (k + 1) + 1Thus, P(k) P(k + 1), and so P(n) is true for all integers n 1 (R1)

(c) e(1+1/2+1/3+...+1/n) = e1e1/2e1/3...e1/n (M1) (1 + 1) (from (a) (ii)) = n + 1 (from (b)) (M1) >n (AG) (d) 1 + > 100 (1+1/2+1/3+... e +1/n) > e100 (M1) We require a value for n for which n > e100. (R1) Any integer greater than e100 will do. (A1) [18]

3. Let f(n) = 5n + 9n + 2 and let Pn be the proposition that f(n) is divisible by 4.Then f(1) = 16 A1So P1 is true A1Let Pn be true for n = k ie f(k) is divisible by 4 M1Consider f(k + l) = 5k+1 + 9k+l + 2 M1 = 5k(4 + 1) + 9k(8 + 1) + 2 A1 = f(k) + 4(5k + 2 9k) A1Both terms are divisible by 4 so f(k +1) is divisible by 4. R1 Pk true k+l true P R1Since P1 is true, Pn is proved true by mathematical induction for n +. R1 [9] 4. (a)cos(A + B) = cos AcosB sin AsinB,cos(A B) = cos AcosB + sin AsinB (M1)(A1)Hence cos(A + B) + cos(A B) = 2cos AcosB (AG) 2

(b) (i)

T1(x) = cos(arccosx) (M1)= x (A1) (ii) T2(x) = cos(2arccosx)(A1) = 2 cos (arccosx) 1(A2)= 2x2 1 (AG) 5 (i) Tn+1(x) + Tn1(x) = cos[(n + 1)arccosx] + cos[(n 1)arccosx] (A1)Using part (a) with A = narccosx, B = arccosx(M1)Tn+1(x) + Tn1(x) = 2cos(narccosx)cos(arccosx) (A1)= 2xcos(arccosx) (A1)= 2xTn(x) (AG)

(c)

(ii) Let Pn be the statement: Tn(x) is a polynomial of degree, n +T1(x) = x, a polynomial of degree one. (A1)So P1 is true.T2(x) = 2x2 1, is a polynomial of degree two.(A1)So P2 is true.Assume that Pk is true. (M1)From part (c)(i), Tk+1(x) = 2xTk(x) Tk1 (x) (M1)Assume Pk1 is true as well.(M1) Tk(x) has degree k k (x) has degree (k + 1)(A1) 2xT and as Tk+1(x) has degree (k 1) k+1(x) has T degree (k + 1)(A1)By the principle of mathematical induction, Pn is true forall positive integers n.(R1) 12 Notes: These arguments may be in a different order. There is a maximum of 6 marks in part (ii) for candidates who do not consider a two stage process. [19]