Page 1 of 12

Chapter 9 Principle of Mathematical Induction

Try these 9.1
(a) RTP n(n 1) (n 2) 1 > 2n, n 4
i.e. n! > 2n, n 4
Proof:
4! = 24
24 = 16
Since 24 > 16
n! > 2n when n = 4
Assume true for n = k, i.e. k! > 2k
RTP true for n = k + 1, i.e. (k + 1)! > 2k+1
Proof:
Since k + 1 > 4
k +1 > 2
Also k! > 2k
k! k + 1 > 2k 2
(k + 1)! > 2k+1
Hence when n = k + 1, n! > 2n
By PMI n! > 2n for all n 4
(b) Given u1 = 1, u2 = 2 and un + 2 = un + 1 + un for n 1
RTP un2+1 un un + 2 =
(1) n 1
Proof:

u1 = 1, u2 = 2, u3 = u2 + u1 = 3
When n = 1, u22 u1 u3 =
4 (1) (3) =
1 = (1)1 1
when n = 1, un2+1 un un + 2 =
(1) n 1
Assume true for n = k, i.e. uk2+1 uk uk + 2 =
(1) k 1
RTP true for n = k + 1, i.e. uk2+ 2 uk +1 uk +3 =
(1) k +11
Proof:

uk2+ 2 uk +1 uk +3 =
uk2+ 2 uk +1 (uk + 2 + uk +1 )
= uk2+ 2 uk2+1 uk +1 uk + 2
Exercise 9A
n

RTP

n(n + 3)
2

(r + 1) =
r =1

( r + 1) =

PROOF : when n = 1, LHS =

1+1= 2

r =1

(1) (1 + 3) 4
= = 2
2
2
LHS = RHS

RHS=

Assume true
=
for n k , i.e. =
(r + 1)
r =1

Unit 2 Answers: Chapter 9

k (k + 3)
2

Macmillan Publishers Limited 2013

Page 2 of 12

k +1

RTP true for n = k + 1, i.e. ( r + 1) =

r =1

(k + 1) (k + 1 + 3)
2

PROOF:
k +1

(r + 1)=

(r + 1) + (k + 2)

r 1=
r 1
=

k (k + 3)
+ (k + 2)
2
1 2
=
(k + 3k + 2 k + 4)
2
1 2
=
(k + 5k + 4)
2
1
= (k + 1) (k + 4)
2
1
=
(k + 1) (k + 1 + 3)
2
k +1
1
=
Hence (r + 1)
(k + 1) (k + 1 + 3).
2
r =1

by PMI

n(n + 3)
2

(r + 1) =
r =1

RTP

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

n 2
(n + 6 n + 11)
3

PROOF:
When n = 1, LHS = (1 + 1) (1 + 2) = 6
1
18
RHS = (12 + 6(1) + 11) = = 6
3
3
LHS = RHS
n
n 2
When n= 1, (r + 1) (r + 2)=
(n + 6n + 11)
3
r =1
k

Assume true for n= k , i.e. (r + 1) (r + 2)=

r =1

k 2
( k + 6k + 11).
3

RTP true for n = k + 1,

k +1
k +1
+ 2)
i.e. (r + 1) (r=
((k + 1) 2 + 6 (k + 1) + 11).
3
r =1
PROOF:
k +1

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

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

k 2
(k + 6 k + 11) + (k 2 + 5k + 6)
3
1 3
=
(k + 6k 2 + 11k + 3k 2 + 15k + 18)
3
1 3
=
(k + 9k 2 + 26k + 18)
3
1
=
(k + 1) (k 2 + 8k + 18)
3

Unit 2 Answers: Chapter 9

Macmillan Publishers Limited 2013

Page 3 of 12

1
(k + 1)(k 2 + 2k + 1 + 6k + 6 + 11)
3
1
=
(k + 1) [(k + 1) 2 + 6 (k + 1) + 11]
3
k +1
1
(r + 1) (r + 2)=
(k + 1) [(k + 1) 2 + 6( k + 1) + 11]
3
r =1

Hence by PMI (r + 1) (r + 2)=

r =1

n 2
(n + 6n + 11)
3

RTP (2r 1) =
n2
r =1

PROOF:
When n = 1, LHS = 2(1) 1 = 1
RHS = 12 = 1
LHS = RHS
n

When
=
n 1, (2r=
1) n 2
r =1

=
=
Assume true
for n k , i.e.
(2r 1) k 2
r =1

k +1

RTP true for n = k + 1, (2r 1) = (k + 1) 2

r =1

k +1

PROOF:

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

=
r 1=
r 1

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

k +1

(2r 1)

=(k + 1)2

r =1

n2
Hence by PMI (2r 1) =
r =1

RTP =
2r 2(2n 1)
r =1

PROOF:
When n= 1, LHS= 2=1 2
RHS = 2(21 1) = 2
n

When
2r 2(2n 1)
=
n 1, =
r =1

=
=
Assume true for
n k , i.e.
2r 2 (2k 1)
r =1

k +1

RTP true for n =

k + 1, i.e. 2r =
2(2k + 1 1)
r =1

k +1

PROOF:
=
2r

+ 2k + 1

r 1=
r 1
=

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

Unit 2 Answers: Chapter 9

Macmillan Publishers Limited 2013

Page 4 of 12

= 2k + 1 2 + 2k + 1
= 2(2k + 1 ) 2
= 2[2k + 1 1]
k +1

=2 2

r =1

k +1

Hence by PMI =
2r 2(2n 1)
r =1

RTP

1 1
(1 3 n )
=

3 2

r =1

PROOF:
1

1 1
When n = 1, LHS
= =
3 3
1
1 1 1 2 1
(1 31 ) = 1 = =
2
2
3 2 3 3
LHS = RHS

RHS =

1 1
When n = 1,
(1 3 n )
=

3 2

r =1
k

Assume true for n = k, i.e.

r =1

k +1

RTP true for n = k + 1, i.e.

r =1

k +1

1
PROOF: =

3

=
r 1=
r 1

1
1
(1 3 k )
=

3
2
r

1
=

1 1
+
3
3

1
1 3 ( k + 1)
2

k +1

k +1

1
1 1
1 k +
2
3
3
1 1 1 1 1
=
+
2 2 3k 3 3k

1 1 1

2 6 3k

1 1
1 3 k
3

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

1
2

k +1

r =1

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

Unit 2 Answers: Chapter 9

)
Macmillan Publishers Limited 2013

Page 5 of 12

Hence by PMI

1 1
1 3 n
=

3 2

r =1

RTP

(4r + 5)=

n(2n + 7)

r =1

PROOF: When n = 1
LHS = 4(1) + 5 = 9
RHS = 1(2(1) + 7) = 9
LHS = RHS
n

When n = 1,

(4r + 5)=

n(2n + 7)

r =1

(4r + 5)=

Assume true for n = k, i.e

k (2k + 7)

r =1

k +1

RTP true for n = k + 1, i.e.

(4r + 5) = (k + 1) (2(k + 1) + 7)
r =1

k +1

PROOF:

5) (4r + 5) + 4 (k + 1) + 5
(4r +=

r 1=
r 1
=

= k(2k + 7) + 4k + 9
= 2k2 + 11k + 9
= (k + 1) (2k + 9)
= (k + 1) (2(k + 1) + 7)
n

Hence by PMI

(4r + 5)=

n(2n + 7)

r =1

RTP

r(2r 1) =n(n + 1)6(4n 1)

r =1

PROOF: When n = 1, LHS = 1(2(1) 1) = 1

(1) (1 + 1) (4 1) 6
= = 1
RHS=
6
6
LHS = RHS
n

When n = 1,

r(2r 1) =

n(n + 1) (4n 1)
6

r =1

Assume true for n = k,

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

k +1

RTP true for n = k + 1, i.e.

r (2r 1) =
r =1

k +1

PROOF:

(k + 1)(k + 1 + 1) (4(k + 1) 1)
6

r (2r=
1)

r (2r 1) + (k + 1) (2(k + 1) 1)

r 1=
r 1
=

Unit 2 Answers: Chapter 9

Macmillan Publishers Limited 2013

Page 6 of 12

k (k + 1) (4k 1)
+ (k + 1) (2k + 1)
6
(k + 1)(4k 2 + 8k + 6)
=
6
(k + 1)(k + 2) (4k + 3)
=
6
(k + 1) (k + 1 + 1) (4(k + 1) 1 )
=
6
n

Hence by PMI

r (2r 1) =n(n + 1)6(4n 1)

r =1

RTP

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

n
(2n 2 + 7n + 7)
2

PROOF:
When n = 1, LHS= (3(1) + 1) (1 + 1)= (4) (2)= 8
1
16
(2 + 7 + 7) =
= 8
RHS =
2
2
LHS = RHS
n

When n = 1,

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

n 2
(2n + 7n + 7)
2

Assume true for n = k, i.e.

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

k +1

RTP true for n = k + 1, i.e.

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

k
(2k 2 + 7k + 7)
2
k +1
(2(k + 1)2 + 7(k + 1) + 7)
2

PROOF:
k +1

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

r 1=
r 1
=

=
=
=
=
=

k
(2k 2 + 7k + 7) + (3k + 4) (k + 2)
2
1
(2k 3 + 7k 2 + 7k + 6k 2 + 20k + 16)
2
1
(2k 3 + 13k 2 + 27k + 16)
2
1
(k + 1) (2k 2 + 11k + 16)
2
1
(k + 1) (2k 2 + 4k + 2 + 7k + 7 + 7)
2
(k + 1)
[2(k + 1)2 + 7(k + 1) + 7]
2
n

By PMI

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

Unit 2 Answers: Chapter 9

n 2
(2n + 7n + 7)
2

Macmillan Publishers Limited 2013

Page 7 of 12

RTP

r =1

n(n + 1) (n 2 + n + 2)
r (r 2 + 1) =
4

PROOF:
When n = 1, LHS = (1) (12 + 1) = 2
(1) (1 + 1) (1 + 1 + 2) (2) (4)
=
= = 2
RHS
4
4
LHS = RHS
n

When n = 1,

r =1

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

Assume true for n = k, i.e.

r =1

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

k +1

RTP true for n = k + 1, i.e.

r =1

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

PROOF:
k +1

r (r =
+ 1)
2

r (r

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

r =1

r =1

k (k + 1)(k + k + 2)
+ (k + 1) (k 2 + 2k + 2)
4
(k + 1)(k 3 + k 2 + 2k + 4k 2 + 8k + 8)
=
4
3
2
(k + 1)(k + 5k + 10k + 8)
=
4
(k + 1)(k + 2) (k 2 + 3k + 4)
=
4
(k + 1) (k + 2) ((k + 1) 2 + (k + 1) + 2)
=
4
2

Hence by PMI

r =1

n(n + 1) (n 2 + n + 2)
r (r 2 + 1) =
4

10

RTP

(2r + 1) (4r =1)

r =1

n
(8n 2 + 15n + 4)
3

PROOF:
When n = 1, LHS = (2(1) + 1) (4(1) 1)
= (3) (3) = 9
1
27
RHS = (8 + 15 + 4) =
= 9
3
3
LHS = RHS
n

When n = 1,

(2r + 1) (4r =1)

r =1

Unit 2 Answers: Chapter 9

n
(8n 2 + 15n + 4)
3

Macmillan Publishers Limited 2013

Page 8 of 12

Assume true for n = k, i.e

(2r + 1) (4r =1)

r =1

k
(8k 2 + 15k + 4)
3

RTP true for n = k + 1

k +1

i.e.

r 1)
(2r + 1) (4=
r =1

k +1
(8(k + 1) 2 + 15(k + 1) + 4)
3

PROOF:
k +1

(2r + 1) (4r
=
1)

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

=
r 1=
r 1

=
=
=

=
=
=

k
(8k 2 + 15k + 4) + (8k 2 + 18k + 9)
3
1 3
[8k + 15k 2 + 4k + 24k 2 + 54k + 27]
3
1 3
(8k + 39k 2 + 58k + 27)
3
1
(k + 1)(8k 2 + 31k + 27)
3
1
(k + 1)(8k 2 + 16k + 8 + 15k + 15 + 4)
3
1
(k + 1) (8(k + 1)2 + 15(k + 1) + 4)
3
n

Hence by PMI

r =1

11

n(n + 1) (n 2 + n + 2)
(2r + 1) (4r 1) =
4

a1 = 1, an + 1 = 5 an + 2
(a)
a2 = 5a1 + 2 = 7
a3= 5a2 + 2= 5(7) + 2= 37
a4= 5a3 + 2= 5(37) + 2= 187
a5= 5a4 + 2= 5(187) + 2= 937
First five terms are: 1,7, 37, 187, 937
3 n 1 1
=
an
(5 )
(b) RTP
2
2
PROOF:
3 1
When n = 1, a1 = = 1
2 2
3 n 1 1
(5 )
Hence when n =
= 1, an
2
2
3 k 1 1
(5 )
Assume true for n = k,=
i.e. ak
2
2
3 k +11
1
(5
)
RTP true for n = k + 1,=
i.e. ak + 1
2
2
PROOF:
Since an=
+ 1 5an + 2

ak + 1 =
5ak + 2

Unit 2 Answers: Chapter 9

Macmillan Publishers Limited 2013

Page 9 of 12

1
3
=
ak + 1 5 (5k 1 ) + 2
2
2
3 k 1
5
=
(5 5) + 2
2
2
3 k +11 1
=
(5
)
2
2
3 n 1 1
=
an
(5 )
Hence by PMI
2
2
12
a0 = 2, an + 1 = 1 2an
1 5
RTP an = + (2) n , n 0
3 3
PROOF:
1 5
1 5 6
When n = 0, a0 = + (2)0 = + = = 2
3 3
3 3 3
1 5
When n = 0, an = + (2) n
3 3
1 5
Assume true for n = k, i.e. ak = + (2) k
3 3
1 5
RTP true for n = k + 1, i.e. ak + 1 = + (2) k + 1
3 3
PROOF:
ak + 1= 1 2ak

13

1 5

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

2 5
=1 + (2) k (2)
3 3
1 5
= + ( 2) k + 1
3 3
1 5
Hence by PMI an = + (2) n
3 3
6
a1= 1, an + 1= 5
an + 2
RTP an < 4
PROOF:
Since 1 < 4
a1 < 4
Hence when n = 1, an < 4
Assume true for n = k i.e. ak < 4
RTP true for n = k + 1 i.e. ak + 1 < 4
PROOF:
Since ak < 4
ak + 2 < 6
6
1<
ak + 2
6
1 >
ak + 2

Unit 2 Answers: Chapter 9

Macmillan Publishers Limited 2013

Page 10 of 12

6
ak + 2
6
4>5
ak + 2
6
Since 5
ak +1
=
ak + 2
4 > ak +1
Hence by PMI an < 4 n 1
5 1> 5

14

1
un + 1 =+
un u , u1 =
n
n 1

RTP un 23
PROOF:
Since 1 1

1 1

u1 1 and u1= 23 = 1
n 1

When n = 1, un 23

k 1

Assume true for n = k, i.e. uk 23

RTP true for n = k + 1, i.e. uk + 1 23

PROOF:
k 1

Since uk 23
k 1
1
uk +
23
uk

( )

3k 1
uk + u 2
k

(2 ) = 2
3

3k 1

3k 1

k 1

23

k 1

23

k 1

= 233

k 1+1

= 23

k +11

= 23

n 1

Hence by PMI un 23
15

=
u1 1, un=
+ 1 un +

un

RTP un 22
PROOF:
Since 1 1

n 1

11

1 22

11

u1 22

Hence when n = 1, un 22

n 1

Assume true for n = k, i.e. uk 22

k 1

RTP true for n = k + 1, i.e. uk + 1 22

Unit 2 Answers: Chapter 9

k +11

Macmillan Publishers Limited 2013

Page 11 of 12

PROOF:
k 1

Since uk 22
k 1
1
uk +
22
uk

( )

2k 1
uk + u 2
k

( )
k 1

k 1

2
2 2
2=
22
Since 2=

uk + 1 22

k 1+1

k +1 1

n 1

16

Hence by PMI un 22 , n 1
a1 = 1, an = an 1 + 3, n 2
RTP a=
n 3n 2
PROOF:
a2 = a1 + 3 =1 + 3 = 4
a2= 3(2) 2= 4
When n = 2, a=
n 3n 2
Assume true for n = k
i.e. ak = 3k 2
RTP true for n = k + 1
i.e. ak + 1 = 3(k + 1) 2
PROOF:
ak +=
1 ak + 3
= 3k 2 + 3
= 3k + 3 2
= 3(k + 1) 2
ak + 1 = 3(k + 1) 2
Hence by PMI a=
n 3n 2

17

RTP 2n > n
PROOF: Since 2 > 1
21 > 1
When n = 1, 2n > n
Assume true for n = k, i.e. 2k > k
RTP true for n = k + 1, i.e. 2k + 1 > k + 1
PROOF: Since 2k > k
2k 2 > k + 1

2k + 1 > k + 1
Hence by PMI 2n > n, n 1
18

RTP 2an= 2n 1 + (1) n , for n 1

a=
0 0 and an +=
1 2n an
PROOF:
n = 1, 2a1 = 2 1 + ( 1)1 = 2 2 = 0
a1 = 0

Unit 2 Answers: Chapter 9

Macmillan Publishers Limited 2013

Page 12 of 12

From an +=
1 2 n an

a=
= 0
1 2(0) 0
Hence when n = 1, 2an= 2n 1 + (1) n
Assume true for n = k, i.e. 2ak= 2k 1 + ( 1) k
k +1
RTP true for n = k + 1, i.e. 2ak +=
1 2( k + 1) 1 + ( 1)
PROOF:
ak +=
1 2 k ak

2ak +=
1 4 k 2 ak

= 4k 2 [2k 1 + ( 1)k ]
= 2k + 1 ( 1)k
= 2(k + 1) 1 + ( 1) k + 1
k +1
2ak +=
1 2( k + 1) 1 + ( 1)

n
Hence by PMI 2a=
n (2n 1) + (1) , n 1

Unit 2 Answers: Chapter 9

Macmillan Publishers Limited 2013