0% found this document useful (0 votes)
345 views9 pages

Mathematical Induction ACE

The document contains several proofs by mathematical induction. It proves formulas for sums of series, sequences defined by recurrence relations, and other mathematical statements for all positive integers n. The proofs follow the standard pattern of showing the base case is true, assuming the statement is true for some integer k, and proving it is true for k+1. This establishes the statement is true for all positive integers n by the principle of mathematical induction.

Uploaded by

ZhiTing96
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
345 views9 pages

Mathematical Induction ACE

The document contains several proofs by mathematical induction. It proves formulas for sums of series, sequences defined by recurrence relations, and other mathematical statements for all positive integers n. The proofs follow the standard pattern of showing the base case is true, assuming the statement is true for some integer k, and proving it is true for k+1. This establishes the statement is true for all positive integers n by the principle of mathematical induction.

Uploaded by

ZhiTing96
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Solutions to Tutorial 8: Mathematical Induction

Section C : Further Self-Practice 11. Prove by mathematical induction that 1 4 + 2 7 + 3 10 + + n(3n + 1) = n(n + 1) 2 for all positive integers n. Let Pn be the proposition: [J93/I/11]

r (3r + 1) = n(n + 1)
r =1

for n Z +

LHS = (1)(3 + 1) = 4 RHS = (1)(1 + 1) 2 = 4 Since LHS = RHS, P 1 is true When n = 1,


Assume that Pk is true for some k Z + . i.e.
k +1 r =1

r (3r + 1) = k (k + 1)
r =1
2

Need to prove that then


k +1 r =1 k

r (3r + 1) = (k + 1)(k + 2)

LHS of Pk +1 = r (3r + 1) = r (3r + 1) + (k + 1)(3k + 4)


r =1

= k (k + 1) 2 + (k + 1)(3k + 4)

= ( k + 1) ( k 2 + k + 3k + 4 ) = (k + 1)(k 2 + 4k + 4) = (k + 1)(k + 2)2 = RHS of Pk +1 Pk is true Pk +1 is true As P 1 is true and P k is true P k +1 is true , by the principle of mathematical induction, Pn is true for all n Z + . 12. A sequence of numbers u1, u2, u3, is defined by u1 = 2 and 2 u n + 1 = 3 u n + 1 for all
3 positive integral values of n. Prove by induction that un = 2 1 . 2 Let Pn be the proposition: When n = 1, 3 un = 2 1 for n Z + 2
n n

if Pk is true

LHS = u1 = 2 (given) 3 RHS = 2 1 = 2 2 Since LHS = RHS, P 1 is true

Page 1 of 9

3 Assume that Pk is true for some k Z + . i.e. uk = 2 1 . 2

3 Need to prove that then uk +1 = 2 2 LHS of Pk +1 = uk +1 1 ( 3uk + 1) 2 k 1 3 = 3 2 1 + 1 2 2 = 3 = 3 1 2 3 3 = 2 1 2 2


k k

k +1

if Pk is true

3 = 2 1 = RHS of Pk +1 2 Pk is true Pk +1 is true As P 1 is true and P k is true P k +1 is true , by the principle of mathematical induction, Pn is true for all n Z + . n for n Z + . Hence, deduce the n +1 r =1 1 1 1 + + + sum of the first 100 terms of the series . (0.1)(0.2) (0.2)(0.3) (0.3)(0.4) [J89/I/11modified]

k +1

13. Prove by mathematical induction that

r (r + 1) =

Let Pn be the proposition: When n = 1, LHS =

r (r + 1)
r =1

n for n Z + n +1

1 1 = (1)(1 + 1) 2 1 1 RHS = = 1+1 2 Since LHS = RHS, P 1 is true

Assume that Pk is true for some k Z + .i.e. Need to prove that then

r (r + 1)
r =1

k . k +1

r (r + 1)
r =1

k +1

k +1 k+2

Page 2 of 9

LHS of Pk +1 =
k

k +1

1 r =1 r ( r + 1)

1 1 + (k + 1)(k + 2) r =1 r ( r + 1) 1 k if Pk is true = + k + 1 (k + 1)(k + 2) =

( k + 1) k 2 + 2k + 1 = = (k + 1)(k + 2) ( k + 1)(k + 2) k +1 = = RHS of Pk +1 k +2 Pk is true Pk +1 is true


2

As P 1 is true and P k is true P k +1 is true , by the principle of mathematical induction, Pn is true for all n Z + . 1 1 1 + + + 0.1(0.2) 0.2(0.3) 0.3(0.4)

1 1 1 + + + 1 2 2 3 3 4 10 10 10 10 10 10 1 1 1 + + + = 100 1(2) 2(3) 3(4)


=

Sum of first 100 terms = 100

100

2 1 100 100 = = 100 . 100 + 1 101 r =1 r ( r + 1)

14. Prove by induction that

log
r =0
n

2a r =

1 (n + 1)(n + log a 4) for n Z+ . 2

1 (n + 1)(n + log a 4) for n Z + 2 r =0 When n = 1, LHS = log a 2 + log a 2a = log a 2 + log a 2 + log a a = 1 + 2 log a 2 1 RHS = (1 + 1)(1 + log a 4) = 1 + log a 2 2 = 1 + 2 log a 2 2 n n Since LHS = RHS, P r 1 is true Using log a 2a = ( r + log a 2 ) ,
Let Pn be the proposition:

log

2a r =

r =0

r =0

Assume that Pk is true for some k Z . i.e.

prove the result using summation of series ( Refer to Tutorial 6 )

log
r =0

2a r =

1 (k + 1)(k + log a 4) 2

Need to prove that then

log
r =0

k +1

2a r =

1 ( k + 2 )( k + 1 + log a 4 ) 2

Page 3 of 9

LHS of Pk +1 =

log
r =0

k +1

2a r = log a 2a r + log a 2a k +1
r =0

1 (k + 1) ( k + log a 4 ) + log a 2 + ( k + 1) log a a if Pk is true 2 1 = ( k + 2 ) 1) ( k + log a 4 ) + log a 2 + ( k + 1) 2 1 = (k + 2) ( k + log a 4 ) ( k + log a 4 ) + 2 log a 2 + 2 ( k + 1) 2 1 = (k + 2) ( k + log a 4 ) k log a 4 + log a 4 + 2k + 2 2 1 1 = = (k + 2) ( k + 1 + log a 4 ) = RHS of Pk +1 (k + 2) ( k + log a 4 ) + (k + 2) 2 2 Pk is true Pk +1 is true =
As P 1 is true and P k is true P k +1 is true , by the principle of mathematical induction, Pn is true for all n Z + . 15. Prove by induction that, for all positive integers n, and provided x 1 , 1 xn . 1 + x + x 2 + x 3 + + x n 1 = 1 x Let Pn be the proposition: 1 + x + x 2 + x 3 + + x n 1 = When n = 1, LHS = 1 1 x =1 RHS = 1 x Since LHS = RHS, P 1 is true 1 xk 1 x 1 xn 1 x for n Z +

[N95/I/12]

Assume that Pk is true for some k Z + . i.e. 1 + x + x 2 + x3 + + x k 1 = Need to prove that then 1 + x + x 2 + x3 + + x k 1 + x k = LHS of Pk +1 = 1 + x + x 2 + x3 + + x k 1 + x k 1 x k +1 1 x

1 xk + xk if Pk is true 1 x 1 x k + x k (1 x ) 1 x k + x k x k +1 1 x k +1 = = RHS of Pk +1 = = 1 x 1 x 1 x Pk is true Pk +1 is true As P 1 is true and P k is true P k +1 is true , =


by the principle of mathematical induction, Pn is true for all n Z + .

Page 4 of 9

16. A sequence of real positive numbers u1 , u2 , u3 , ... satisfies the recurrence relation

un +1 = un + 4 + 4 un + 1, n Z + and u1 = 15 .
(i) Prove by mathematical induction that un = 4 ( n + 1) 1 for all n Z + .
2

(ii) Express

1 A B , where A and B are constants to be determined. in the form + un 2n + 1 2n + 3

(iii) Hence find

u
n =1

1
n

in terms of N. Give a reason why this series is convergent and state


N

the sum to infinity.


(iv) Using your answer in part (iii), find

4n
n =1

1
2

[2009/AJC/I/12 (modified)]

(i) Let Pn be the proposition: un = 4 ( n + 1) 1 for n Z +


2

When n = 1 , L.H.S. = u1 = 15 R.H.S. = 4 ( 2 ) 1 = 15


2

Since LHS = RHS, P 1 is true


2

Assume that the statement is true for some k Z + ., i.e. uk = 4 ( k + 1) 1 Need to show that then uk +1 = 4 ( k + 2 ) 1
2

L.H.S. = uk +1 = uk + 4 + 4 uk + 1 = 4 ( k + 1) 1 + 4 + 4 4 ( k + 1) 1 + 1
2 2

= 4 ( k + 1) 1 + 4 + 4 2 ( k + 1)
2
2 2 = 4 ( k + 1) + 2 ( k + 1) + 1 1 = 4 ( k + 1) + 1 1

= 4 ( k + 2) 1
2

Pk is true Pk +1 is true As P 1 is true and P k is true P k +1 is true , by the principle of mathematical induction, Pn is true for all n Z + . (ii) 1 1 1 1 = = = 2 2 un 4 ( n + 1) 1 2 ( n + 1) 1 ( 2 ( n + 1) 1) ( 2 ( n + 1) + 1) 1 1 1 = = 2 ( 2n + 1) 2 ( 2n + 3) ( 2n + 1)( 2n + 3) 1 1 A= , B = 2 2
N 1 1 1 = 2 ( 2n + 3 ) n =1 un n =1 2 ( 2n + 1)

(iii) S N =

Page 5 of 9

1 1 1 2 3 5 1 1 + 5 7 +

1 1 2N 1 2N +1 1 1 + 2N +1 2N + 3 1 1 1 1 1 = . = 6 2 ( 2 N + 3) 2 3 2N + 3

As N ,

1 0 ( 2 N + 3)
1 1 1 , therefore it is a convergent series. S = . 6 6 n =1 un
N

Hence the series S N =

(iv)

1 2 n =1 4n 1 t = 0 4(t + 1) 1 1 N 1 1 = + 3 t =1 4(t + 1) 2 1 1 1 1 = + 3 6 2(2( N 1)) + 3) 1 1 = 2 2(2 N + 1)


2

N 1

(replace n by t + 1)

17. The rth term of a sequence is given by ur = r (r !) , for r =1, 2, 3, (i) Write down the first five terms of the series, and hence state the values of for n =1, 2, 3, 4 and 5. (ii) (iii) Make a conjecture for a formula for

u
r =1

u
r =1

in terms of n.

Prove your answer in part (ii) by mathematical induction for n Z + .

(i) (ii)

u = ( n + 1) ! 1
r =1 r

Page 6 of 9

(iii)

Let Pn be the proposition: When n = 1, LHS =

u = ( n + 1)! 1
r =1 r

for n Z +

u
r =1

= u1 = 1

RHS = (1 + 1) ! 1 = 2! 1 = 1 Since LHS = RHS, P 1 is true Assume that Pk is true for some k Z + . i.e. Need to prove that then LHS of Pk +1 =

u = ( k + 1)! 1
r =1 r

u = ( k + 2 )! 1
r =1 r

k +1

u
r =1

k +1

= ur + uk +1
r =1

= (k + 1)! 1 + (k + 1)[(k + 1)!] = (k + 1)! [1 + (k + 1)] 1 = (k + 1)!(k + 1) 1 = (k + 2)! 1 = RHS of Pk +1

Pk is true Pk +1 is true As P 1 is true and P k is true P k +1 is true , by the principle of mathematical induction, Pn is true for all n Z + .
Section D : Challenging Questions

18. All the terms of the arithmetic progression u1,u2,u3, ..., un ,... are positive. Use mathematical

induction to prove that, for n 2, n Z + 1 1 1 1 n 1 + + + .. + = . u1u2 u2u3 u3u4 un 1un u1un Let a = 1st term of A.P. d = common difference of A.P. i.e. u n = a + (n 1)d 1 1 1 1 n 1 + + + .. + = . for n 2, n Z + u1u2 u2u3 u3u4 un 1un u1un

Let Pn be the proposition:

Observe that first term is when n = 2

Page 7 of 9

1 u1u2 2 1 1 = RHS = u1u2 u1u2 Since LHS = RHS, P 1 is true When n = 2, LHS = Assume that Pk is true for some k Z + , k 2 .i.e. Need to prove that then LHS of Pk +1 =
k

u
r =2

1 k 1 = u1uk r 1ur

u
r =2

k +1

1 k = . u1uk +1 r 1ur

1 r = 2 ur 1ur

k +1

= =

1 1 + uk uk +1 r = 2 ur 1ur if Pk is true

1 k 1 + u1uk uk uk +1 (k 1)u k +1 + u1 = u1u k u k +1 (k 1)u k +1 + u1 = u1u k u k +1 (k 1)(a + kd ) + a = u1u k u k +1 (k 1)a + (k 1)kd + a = u1uk uk +1
= = ka + (k 1)kd u1uk uk +1 u1uk uk +1

since un = a + (n 1) d

k [ a + (k 1)d ]

ku k u1u k u k +1 k = == RHS of Pk +1 u1uk +1

Pk is true Pk +1 is true As P 1 is true and P k is true P k +1 is true , by the principle of mathematical induction, Pn is true for all n Z + , n 2 .

Page 8 of 9

19. (i) Using the formula for sin ( A B ) , prove that


1 1 sin ( r + 1 2 ) sin ( r 2 ) 2 cos r sin 2 .

[2] [3]

(ii) Hence find a formula for

cos r
r =1

1 in terms of sin ( n + 1 2 ) and sin 2 .

(iii)Prove by the method of mathematical induction that for all positive integers n.

sin r =
r =1

1 cos 1 2 cos ( n + 2 )

2sin 1 2 [6] [N11/I/6]

1 1 1 1 1 (i) sin ( r + 1 2 ) sin ( r 2 ) = sin r cos 2 + cos r sin 2 [ sin r cos 2 cos r sin 2 ]

(ii)

cos r =
r =1 r =1

1 sin ( r + 1 2 ) sin ( r 2 )

= 2 cos r sin 1 2 = 1 2sin 1 2

1 1 sin ( n + 1 2 ) 1 1 + = sin sin 1 n ( ) 2 2 2sin 1 2 sin 1 2 2 1 n cos 1 cos n + ( 2 ) for n Z + 2 (iii)Let Pn be the proposition: sin r = 1 2sin 2 r =1 =

2sin 1 2

sin ( r + ) sin ( r )
r =1
1 2 1 2

When n = 1,

LHS =

sin r = sin
r =1

3 cos 1 2sin sin 1 2 cos 2 2 = = sin RHS = 2sin 1 2sin 1 2 2 Since LHS = RHS, P 1 is true

Assume that Pk is true for some k Z + . for some k Z + . 1 2sin r =1 2 1 k +1 cos 1 2 cos ( k + 1 + 2 ) i.e. Need to prove that then sin r = 2sin 1 r =1 2 i.e. assume that LHS of Pk +1 = =
=
1 2

sin r =

1 cos 1 2 cos ( k + 2 )

sin r = sin r + sin ( k + 1)


r =1
1 2

k +1

cos cos ( k + 2sin 1 2

) + sin

r =1

( k + 1)

1 1 cos 1 2 cos ( k + 2 ) + 2sin ( k + 1) sin 2

2sin 1 2 Pk is true Pk +1 is true

1 1 1 cos 1 2 cos ( k + 2 ) cos ( k + 1 + 2 ) cos ( k + 2 )

2sin 1 2
=
1 cos 1 2 cos ( k + 1 + 2 )

2sin 1 2

As P 1 is true and P k is true P k +1 is true , by the principle of mathematical induction, Pn is true for all n Z + .

Page 9 of 9

You might also like