Page 1 of 20

Chapter 3 Principle of Mathematical Induction

Try these 3.1

12
12(12 + 1) (2(12) + 1)
(a) ∑r r =1
2
=
6
(12)(13)(25)
=
6
= 650
30 30 9
(b)
=
∑=
r 10=
r2
r 1=r 1
∑ r2 − ∑ r2
30 (31) (61) 9(9 + 1)(18 + 1)
= −
6 6
= 9455 − 285 = 9170

Try these 3.2

20
(a) ∑ r(r + 3)
r =1
20 20
=
=r 1=r 1
∑r 2
+ 3∑ r

20 (21) (41)  20 (21) 

= +3  = 3500
6  2 
25 25 9
(b) ∑ 2r(r +=
=r 10=r 1 =r 1
1) ∑ 2r(r + 1) − ∑ 2r(r + 1)
25 25 9 9
= 2∑ r 2 + 2∑ r − 2∑ r 2 − 2∑ r
=r 1 =r =
1 r 1 =r 1

2(25)(26)(51) 2(25)(26) 2(9)(10)(19) 2(9)(10)

= + − −
6 2 6 2
= 11 040
n n n
(c)
=r 1
∑ r(r 2 + 2r)= =r 1 =r 1
∑ r 3 + 2∑ r 2
n 2 (n + 1) 2 2n(n + 1)(2n + 1)
= +
4 6
n(n + 1)
= [3n(n + 1) + 4(2n + 1)]
12
n(n + 1) 1
= [3n 2 +=
11n + 4] n(n + 1)(3n 2 + 11n + 4)
12 12

Exercise 3A

1 1 1 1 1
1 , , , , ,
3 9 27 81 343

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 2 of 20

1 1 1
=u1 =1
, u2 = 2
, u3 ...
3 3 33
1
un = n
3
2 16, 13, 10, 7, 4, …
Sequence decreasing by 3
un = an + b
un = −3n + b
u1 = 16 ⇒ 16 = −3 + b
b = 19
un = −3n + 19
1 1 1 1
3 , , , ,
2 × 5 3 × 7 4 × 9 5 × 11
2, 3, 4, ….
n+1
5, 7, 9, …
2n + 3
1
∴un =
(n + 1) (2n + 3)
4 8 + 16 + 32 + 64 + 128 + 256 + 512
u = 2r+2
7

∑2
r =1
r+2

5 9 + 12 + 15 + … + 30
ur = 3r + 6
8

∑ (3r + 6)
r=1

6 4 × 5 + 5 × 6 + 6 × 7 + … + 10 × 11
ur = (r + 3) (r + 4)
7

∑ (r + 3) (r + 4)
r =1
n
7 ∑ (6r − 5)
r =1

un = 6n − 5
n
8 ∑ (4r
r =1
2
− 3)

un = 4n2 − 3
2n
9 ∑ (r
r =1
3
+ r2 )

u n = n3 + n2
4n
10 ∑ (6r
r =1
3
+ 2)

un = 6n3+ 2
n+2
11 ∑3
r =1
2r − 1

un = 32n−1
12 u16 = 7(16) + 3 = 115

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 3 of 20

13 u8 = 3(9)2 − 1 = 242
1 1
14 r = 14, u10 = =
4(14) − 2 54
25 25 25
15
=r 1 =r=1
∑ (r − 2)= ∑ r − ∑ 2
r 1

25(26)
= − 25(2)
2
= 275
30 30 30
16
=r 1 =r=1
∑ (6r=
r 1
+ 3) 6∑ r + ∑ 3

(30) (31)
= 6 + 30 (3)
2
= 2880
50
17 ∑ r(r + 2)
r=1
50 50
= ∑r r =1
2
+ 2∑ r
r=1

50 (51) (101) 2 (50) (51)

= +
6 2
= 45 475
10
18 ∑r
r=1
2
(r + 4)
10 10
= ∑ r 3 + 4∑ r 2
r=1 r=1

(10) (11)2 4(10) (11) (21)

2
= +
4 6
= 3025 + 1540
= 4565
45
19 ∑ 6r (r +1)
r =1
45 45
= 6∑ r 2 + 6∑ r
r=1 r=1

6 (45) (46) (91) 6(45) (46)

= +
6 2
= 194 580
12 12 4
20 ∑ (r + 4)= ∑ (r + 4) − ∑ (r + 4)
=r 5 =r 1 =r 1
12 12 4 4
= ∑r+ ∑4− ∑r − ∑4
=r 1=r 1=r 1=r 1

12 (13) (4) (5)

= + (4) (12) − − (4) (4)
2 2
= 78 + 48 – 10 – 16
= 100
25
21 ∑ (r
r =10
2
− 3)

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 4 of 20

25 9
=
=r 1 =r 1
∑ (r 2 − 3) − ∑ (r 2 − 3)
25 25 9 9
=
=r 1 =r =
1
∑ r2 − ∑ 3 − ∑ r2 + ∑ 3
r 1 =r 1

(25) (26) (51) 9 (10) (19)

= − (25) (3) − + (9) (3)
6 6
= 5192
30
22 ∑ r(3r − 2)
r = 15
30 30 14 14
= 3∑ r 2 − 2∑ r − 3∑ r 2 + 2∑ r
=r 1 =r 1 =r 1 =r 1

3 (30) (31) (61) 2 (30) (31) 3 (14) (15) (29) 2 (14) (15)
= − − +
6 2 6 2
= 24 600
40
23 ∑ (2r +1) (5r + 2)
r=9
40 8
=
=r 1 =r 1
∑ (10r 2
+ 9r + 2) − ∑ (10r 2 + 9r + 2).
40 40 40 8 8 8
= 10∑ r 2 + 9∑ r + ∑ 2 − 10∑ r 2 − 9∑ r − ∑ 2
=r 1 =r 1 =r 1 =r 1 =r 1 =r 1

10 (40) (41) (81) 9 (40) (41) 10 (8) (9) (17) 9 (8) (9)
= + + (40) (2) − − − (8) (2)
6 2 6 2
= 226 480
n
24 ∑ (r + 4)
r =1
n n
=
=r 1 =r 1
∑r + ∑4
n(n +1)
= + 4n
2
n
= (n + 1 + 8)
2
1
= n (n + 9)
2
n
25 ∑ 3r(r +1)
r =1
n
= ∑ (3r 2 + 3r)
r =1
n n
= 3∑ r 2 + 3∑ r
=r 1 =r 1

3n(n + 1)(2n + 1) 3n(n + 1)

= +
6 2
n(n + 1)
= [2n + 1 + 3]
2

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 5 of 20

n(n +1)
= (2n + 4)
2
= n (n + 1) (n + 2)
n
26 ∑ 4r(r − 1)
r =1
n n
= 4∑ r 2 − 4∑ r
=r 1 =r 1

4n(n + 1)(2n + 1) 4n(n + 1)

= −
6 2
n(n +1)
= [2(2n + 1) − 6]
3
n(n +1)
= (4n − 4)
3
4n(n + 1) (n − 1)
=
3
n
27 ∑rr=1
2
(r + 3)
n n
= ∑r
r=1
3
+ 3∑ r 2
r=1

n (n + 1) 2 3n(n + 1) (2n + 1)
2
= +
4 6
n(n + 1)
= [n(n + 1) + 2(2n +1)]
4
n(n + 1) 2
= [n + 5n + 2]
4
2n
28 ∑ 2r(r − 1)
r=n+1
2n n
= ∑ (2r
r =1
2
− 2r) − ∑ (2r 2 − 2r)
r =1
2n 2n n n
= 2∑ r 2 − 2∑ r − 2∑ r 2 + 2∑ r
r=1 r=1 r=1 r=1

2(2n) (2n + 1) (4n +1) 2(2n)(2n + 1) 2n(n + 1)(2n +1) 2n(n + 1)

= − − +
6 2 6 2
2 1 
= n  (2n + 1)(4n +1) − 2(2n + 1) − (n + 1)(2n + 1) + (n + 1)
3 3 
n
=  2(8n 2 + 6n +1) − (12n + 6) − (2n 2 + 3n + 1) + 3n + 3
3
n 2n(7n 2 − 1)
= (14n 2 −=
2)
3 3
2n
29 ∑ r(r + 4)
r=n+1
2n n
= ∑ (r 2 + 4r) − ∑ (r 2 + 4r)
r=1 r=1

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 6 of 20

2n 2n n n
= ∑ r2 + 4 ∑ r − ∑ r2 − 4 ∑ r
r=1 r=1 r=1 r=1

2n (2n + 1) (4n + 1) 4 (2n) (2n +1) n(n + 1)(2n + 1) 4n(n +1)

= + − −
6 2 6 2
n
= [2(8n 2 + 6n + 1) + 24 (2n +1) − (2n 2 + 3n + 1) − 12 (n + 1)]
6
n
= [14n 2 + 45n + 13]
6
2n
30 ∑ (r + 1) (r − 1)
r=n+1
2n n
= ∑ (r 2 − 1) − ∑ (r 2 − 1)
r=1 r=1
2n 2n n n
=
=r 1 =r =
1
∑ r2 − ∑1 − ∑ r2 + ∑1
r 1 =r 1

2n(2n + 1) (4n + 1) n(n + 1) (2n + 1)

= − 2n − +n
6 6
2n(8n 2 + 6n + 1) n(2n 2 + 3n + 1)
= − −n
6 6
n
= [16n 2 + 12n + 2 − 2n 2 − 3n − 1 − 6]
6
n
= (14n 2 + 9n − 5)
6
n
= (14n − 5)(n + 1)
6

Exercise 3B

n
1
1 RTP ∑ (3r −=
2) n (3n − 1)
r=1 2
1
1 1
Proof: When n = 1, LHS = ∑ (3r − 2)= 3(1) − 2= 1 , RHS = (1) (3(1) − 1) = × 2 = 1
r =1 2 2
∴ LHS = RHS
n
1
Hence when n=1,
r =1 2
n(3n − 1) ∑ (3r −=
2)

Assume that the statement is true for n = k

k
1
i.e. ∑
r =1
(3r −=
2)
2
k (3k − 1)

RTP the statement true for n = k + 1

k +1
1
i.e. ∑ (3r − 2)= (k + 1) (3(k + 1) − 1)
r =1 2
k +1 k
Proof: ∑ (3r − 2)
r=1
= ∑ (3r − 2) + 3(k + 1) − 2
r=1

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

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 7 of 20

1
=
[3k 2 − k + 6k + 2]
2
1
= (3k 2 + 5k + 2)
2
1
= (k +1) (3k + 2)
2
1
= (k + 1) (3(k + 1) − 1)
2
k +1
1
Hence ∑ (3r − 2)= (k + 1) (3(k + 1) − 1)
r=1 2
n
1
∴ by PMI ∑r=1
(3r −=
2)
2
n (3n − 1)
n
2 RTP ∑ (4r − 3)=
r=1
n (2n − 1)

Proof:
1
When n = 1, ∑ (4r − 3) = 4(1) − 3 = 4 − 3 = 1
r =1

RHS = 1(2(1)−1) = 2−1=1

⇒ LHS = RHS
n
Hence when n = 1, ∑ (4r − 3)=
r =1
n(2n − 1)
k
Assume true for n = k i.e. ∑ (4r − 3) = k (2k − 1)
r=1
k +1
RTP true for n = k + 1 i.e. ∑ (4r − 3)
r =1
= (k + 1) (2(k + 1) − 1)

k +1 k
Proof:
=r 1 =r 1
∑ (4r − 3)= ∑ (4r − 3) + 4(k +1) − 3
= k (2k − 1) + 4k + 1
= 2k2 – k + 4k + 1
= 2k2 + 3k + 1
= (2k + 1) (k + 1)
= (k + 1) (2(k + 1) − 1)
k +1
∴ ∑ (4r − 3) = (k + 1)(2(k +1) − 1)
r=1
n
Hence by PMI ∑ (4r − 3)=
r =1
n(2n − 1)
n
1
3 RTP ∑ (2r − 1) (2r) = 3 n(n + 1)(4n − 1)
r=1
Proof:
1
When n = 1, LHS = ∑ (2r − 1) (2r) =(2(1) − 1) (2(1)) =2
r=1

1 1
RHS = (1) (1 + 1)(4(1) − 1) = ×2 × 3 = 2
3 3
∴ LHS = RHS

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 8 of 20

k
1
Assume true for n = k, i.e. ∑ (2r − 1)=
r=1
(2r)
3
k(k + 1) (4k − 1)
k +1
1
∑ (2r − 1) (2r)
RTP true for n = k + 1, i.e. =
r=1 3
(k +1) (k + 1 + 1) (4(k + 1) − 1)
k +1 k
Proof: ∑ (2r − 1) (2r) = ∑ (2r − 1) (2r) + (2(k + 1) − 1) (2(k + 1))
r=1 r=1

1
= k(k +1) (4k − 1) + (2k +1) (2k + 2)
3
1
= (k +1) [k(4k − 1) + 6(2k + 1)]
3
1
= (k +1) [4k 2 − k + 12k + 6]
3
1
= (k +1) (4k 2 + 11k + 6)
3
1
= (k +1) (k + 2) (4k + 3)
3
1
= (k +1) (k + 1 + 1) (4(k + 1) − 1)
3
k +1
1
=
Hence ∑
r=1
(2r − 1) (2r)
3
(k + 1) (k +1+1) (4(k + 1) − 1)
n
1
Hence by PMI ∑ (2r − 1) = (2r) n(n + 1) (4n − 1)
r=1 3
n
n(n +1) (n + 2) (3n +1)
4 RTP ∑ (r 2 + r 3 ) =
r=1 12
Proof:
1
When n = 1, LHS = ∑ (r 2 + r 3 ) = 12 +13 = 2
r=1

(1) (1 + 1) (1 + 2) (3(1) + 1) 2 × 3 × 4
RHS = = =2
12 12
∴ LHS = RHS
n
n(n +1) (n + 2) (3n +1)
When n = 1, ∑ (r 2 + r 3 ) =
r=1 12
k
k(k +1) (k + 2) (3k +1)
Assume true for n = k i.e. ∑ (r 2 + r 3 ) =
r=1 12
k +1
(k + 1) (k + 1 + 1) (k + 1 + 2) (3(k + 1) + 1)
RTP true for n = k+1 i.e. ∑ (r 2 + r 3 ) =
r=1 12
k +1 k
Proof: ∑ (r=
r=1
2
+ r3 ) ∑ (r
r=1
2
+ r 3 ) + (k + 1)2 + (k + 1)3

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

= + (k +1) 2 + (k +1)3
12
k +1
= [k(k + 2) (3k +1) + 12(k +1) + 12(k +1) 2 ]
12
1
= (k + 1) [3k 3 + 7k 2 + 2k + 12k + 12 + 12k 2 + 24k + 12]
12

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 9 of 20

1
=(k + 1) (3k 3 + 19k 2 + 38k + 24)
12
1
= (k + 1) (k + 2) (3k 2 + 13k +12)
12
1
= (k +1) (k + 2) (k + 3) (3k + 4)
12
1
= (k +1) ((k +1) + 1) ((k +1) + 2) (3(k +1) + 1)
12
n
n(n +1) (n + 2)(3n +1)
Hence by PMI ∑ (r 2 + r 3 ) =
r =1 12
n
n 2 (n +1)2
5 RTP ∑ r3 =
r=1 4
1
Proof: when n = 1, LHS = ∑ r=
r=1
3
1=
3
1

(1) (1 + 1) 2
4 2
RHS= = = 1
4 4
∴ LHS = RHS
n
n 2 (n +1) 2
When n = 1, ∑ r 3 =
r=1 4
k
k 2 (k +1) 2
Assume true for n = k i.e. ∑ r3 =
r=1 4
k+1
(k +1)2 ((k +1) + 1)2
RTP true for n = k + 1 i.e. ∑ r3 =
r=1 4
k+1 k
Proof: ∑r = ∑r
r=1
3

r=1
3
+ (k + 1)3

k (k + 1)
2 2
= + (k + 1)3
4
(k + 1)2 2
= [k + 4(k + 1)]
4
1
= (k + 1)2 (k 2 + 4k + 4)
4
1
= (k + 1) 2 (k + 2) 2
4
n
n 2 (n + 1)2
∴ by PMI ∑ r3 =
r =1 4
n
1 n
6 RTP ∑
r=1
=
r(r +1) n +1
1
1 1 1
Proof: When n=1, LHS = ∑
r =1
= =
r(r +1) 1(1+1) 2
1 1
RHS = =
1+1 2
∴ LHS = RHS
n
1 n
Hence when n=1, ∑
r=1
=
r(r +1) n +1

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 10 of 20

k
1 k
Assume true for n = k i.e. ∑
r =1
=
r(r +1) k + 1
k +1
1 k +1
RTP true for n = k + 1 i.e. ∑r=1 r(r +1)
=
(k + 1) +1
k+1 k
1 1 1
Proof: ∑= ∑ +
r=1 r(r +1) r=1 r(r +1) (k +1) (k +1+1)
k 1
= +
k +1 (k +1)(k + 2)
1  1 
=  k+
k +1  k + 2 
1  k (k + 2) + 1 
=  
k +1  k + 2 
1  k 2 + 2k +1 
=  
k +1  k + 2 
1 (k +1) 2
=
k +1 k + 2
k +1 k +1
= =
k + 2 (k +1) +1
k
1 n
Hence by PMI ∑ r(r +1) = n +1
r=1
n
(−1) n +1 (n)(n +1)
7 RTP ∑
r=1
( −1) r+1 2
r =
2
1
Proof: when n = 1, LHS = ∑ (−1)
r=1
r +1 2
r =
(−1) 2 (1) 2 =
1

(−1) 2 (1) (2)

=
RHS = 1
2
LHS = RHS
n
(−1) n +1 n(n +1)
Hence when n = 1,
r=1
∑ (−1)
r = r+1 2

2
k
( −1) k +1 (k)(k +1)
Assume true for n = k, i.e. ∑ ( −1) r+1 r 2 =
r=1 2
k+2
k +1
( −1) (k +1)(k +1+1)
RTP true for n = k + 1 i.e. ∑ ( −1) r+1 r 2 =
r=1 2
k +1 k
Proof: ∑ (−1)
r=1
r =
r+1 2
∑ (−1)r+1 r 2 + (−1)k + 2 (k +1)2
r=1

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

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 11 of 20

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

=
2
k+2
( −1) (k + 1) (k + 2)
=
2
n
(−1) n +1 (n)(n +1)
Hence by PMI ∑
r =1
( −1) r +1 2
r =
2
n
1 n(n + 3)
8 RTP ∑
r =1 r(r +1)(r + 2)
=
4(n +1)(n + 2)
1
1 1 1 1
Proof: when n = 1, LHS = ∑ = = =
r =1 r(r +1)(r + 2) 1(1 + 1) (1 + 2) 2 × 3 6
(1) (1 + 3) 4 1
=
RHS = =
4(1 + 1) (1 + 2) 4 × 2 × 3 6
∴ LHS = RHS
n
1 n(n + 3)
When n = 1, ∑ =
r = 1 r(r + 1) (r + 2) 4(n + 1)(n + 2)
k
1 k(k + 3)
Assume true for n = k i.e. ∑
r =1
=
r(r + 1) (r + 2) 4(k + 1) (k + 2)
k +1
1 (k +1) ((k +1) + 3)
RTP true for n = k + 1, i.e. ∑ r(r +1) (r +2) = 4((k+1) + 1) ((k + 1) + 2)
r=1
k +1 k
1 1 1
Proof: ∑ = ∑ +
r = 1 r(r +1) (r + 2) r = 1 r(r + 1) (r + 2) (k + 1) (k + 2) (k + 3)
k(k + 3) 1
= +
4(k +1)(k + 2) (k +1) (k + 2) (k + 3)
1  4 
=  k(k + 3) +
4(k +1) (k + 2)  k + 3 
1  k(k + 3) (k + 3) + 4 
=
4(k +1) (k + 2)  k+3 

1  k 3 + 6k 2 + 9k + 4 
=  
4(k +1) (k + 2)  k+3 
1 (k +1) (k 2 + 5k + 4)
=
4(k +1) (k + 2) k+3
(k +1) (k + 4) (k +1)
=
4 (k +1) (k + 2) (k + 3)
(k +1) (k + 4) (k +1) ((k +1 ) + 3)
= =
4(k + 2) (k + 3) 4((k +1) + 1) ((k +1) + 2)
1 n(n + 3)
Hence by PMI ∑ =
r =1 r(r +1) (r + 2) 4(n +1) (n + 2)
n
1 n
9 RTP ∑ =
r=1 (3r − 1) (3r + 2) 6n + 4
1
1 1 1
Proof: when=
n = 1, LHS ∑r=1
= =
(3r − 1) (3r + 2) (3 − 1) (3 + 2) 10

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 12 of 20

1 1
=
RHS =
6(1) + 4 10
⇒ LHS = RHS
n
1 n
When n = 1, ∑
r =1
=
(3r − 1)(3r + 2) 6n + 4
k
1 k
Assume true for n = k i.e. ∑
r=1
=
(3r − 1) (3r + 2) 6k + 4
k +1
1 k +1
RTP true for n = k + 1 i.e. ∑
r =1
=
(3r − 1) (3r + 2) 6(k +1) + 4
k +1 k
1 1 1
Proof: ∑
= ∑
(3r − 1) (3r + 2)
r=1
+
(3r − 1) (3r + 2) (3(k +1) − 1) (3(k +1) + 2)
r=1

k 1
= +
6k + 4 (3k + 2) (3k + 5)
k 1
= +
2(3k + 2) (3k + 2) (3k + 5)
1  2 
=  k+
2(3k + 2)  3k + 5 
1  k(3k + 5) + 2 
=
2(3k + 2)  3k + 5 
1  3k 2 + 5k + 2 
=  
2(3k + 2)  3k + 5 
(3k + 2) (k +1)
=
2(3k + 5) (3k + 2)
k +1 k +1
= =
6k + 10 6(k + 1) + 4
n
1 n
Hence by PMI ∑
r=1 (3r − 1) (3r + 2)
=
6n + 4
10 RTP 3 – 1 = 16 A, A ∈ ℤ, n ≥ 1
4n

Proof: when n = 1, LHS = 34(1) – 1 = 34 – 1 = 81 − 1 = 80

= 16(5)
∴ when n = 1, 34n – 1 is divisible by 16
Assume true for n = k, i.e. 34k −1 = 16A
RTP true for n = k + 1, i.e. 34(k+1) − 1 = 16B
Proof: 34k + 4 – 1
= 34k + 4 + 16A – 34k
= 34k × 34 − 34k + 16A
= 34k (34 − 1) + 16A
=34k (80) + 16A
= 16 [5(34k) + A]
= 16B, B = 5(34k) + A ∈ ℤ
Hence by PMI 34n – 1 is divisible by 16
11 RTP n4 + 3n2 = 4A, A ∈ ℤ, n ≥ 1
Proof: when n = 1, LHS = 14 + 3(1)2
=1+3=4
= 4 (1)

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 13 of 20

∴ when n = 1, n4 + 3n2 is divisible by 4

Assume true for n = k, i.e. k4 + 3k2 = 4A
RTP true for n = k + 1, i.e. (k + 1)4 + 3 (k+1)2 = 4B
Proof:
(k+1)4 + 3(k+1)2
= k4 + 4k3 + 6k2 + 4k + 1 + 3k2 + 6k + 3
= (k4 + 3k2) + 4k3 + 4k + 4 + 6k2 + 6k
= 4A + 4k3 + 4k + 4 + 6k (k + 1)
= 4A + 4k3 + 4k + 4 + 6 (2c) Since k(k + 1) is the product of two consecutive, integers
then k(k + 1) is divisible by 2. i.e. k(k + 1) = 2c
= 4 [A + k3 + k + 1 + 3c]
= 4B
Hence by PMI n4 + 3n2 is divisible by 4

Review exercise 3

1 6 × 7 + 8 × 10 + 10 × 13 + …
(a) un = (2n + 4) (3n + 4)
n n
(b) ∑ u = ∑ (2r + 4) (3r + 4)
r=1
r
r=1
n
= ∑ (6r
r=1
2
+ 20r + 16)
n n n
= 6∑ r 2 + 20∑ r + ∑ 16
r=1 r=1 r=1

6n(n + 1)(2n + 1) 20n(n +1)

= + + 16n
6 2
= n (n + 1) (2n + 1) + 10n (n + 1) + 16n
= n [2n2 + 3n + 1 + 10n + 10 + 16]
= n (2n2 + 13n + 27)
n
2 (a) ∑ r(3r − 2)
r=1
n n
= 3∑ r 2 − 2∑ r
r=1 r=1

3n(n +1)(2n +1) 2n(n +1)

= −
6 2
n(n + 1)
= [2n + 1 − 2]
2
n(n + 1) (2n − 1)
=
2
20
20 (21) (39)
(b) (i) ∑ r(3r = − 2) = 8190
r =1 2
100 100 20

=r 1=
r =1 r 1
(ii) ∑ r(3r − 2) = ∑ r(3r − 2) − ∑ r(3r − 2)
(100) (101) (199)
= − 8190
2
= 996 760

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 14 of 20

n
2n(n +1) (n − 7)
3 RTP ∑ 2r(r − 5) =
r=1 3
Proof:
1
When n=1,=
LHS ∑ 2r(r − 5)
r =1
= 2(1 − 5) = − 8
2(1) (1 + 1)(1 − 7) 2 × 2 × ( −6)
RHS = = = −8
3 3
∴ when n=1, LHS = RHS
n
2n(n + 1)(n − 7)
⇒ ∑ 2r(r − 5) = when n = 1
r=1 3
k
2k(k + 1) (k − 7)
Assume true for n = k, i.e. ∑ 2r(r − 5) =
r=1 3
k +1
2(k + 1) (k + 1 + 1) (k + 1 − 7)
RTP true for n = k + 1, i.e. ∑ 2r(r − 5) =
r =1 3
Proof:
k +1 k

∑ 2r(r −=
r =1
5) ∑ 2r(r − 5) + 2(k+1) (k + 1 − 5)
r=1

2k(k + 1) (k − 7)
= + 2(k + 1) (k − 4)
3
2(k + 1)
= [k(k − 7) + 3(k − 4)]
3
2(k + 1) 2
= [k − 4k − 12]
3
2(k + 1)
= (k + 2) (k − 6)
3
2(k+1) (k+1+1) (k+1 − 7)
=
3
n
2n(n + 1)(n − 7)
Hence by PMI ∑ 2r(r − 5) =
r =1 3
2n–1
4 an = 3 +1
an+1 = 32(n+1) –1 + 1 = 32n+1 + 1
an+1 − an = 32n+1 + 1 − 32n–1 – 1
= 32n+1 − 32n–1
= 32n–1 [32 − 1]
= 8 (32n–1)
RTP an = 32n–1 + 1 = 4A , A ∈ Z for all n ≥ 1
Proof: when n=1, 32-1 + 1 = 3 + 1 = 4(1)
∴ when n=1, an is divisible by 4
Assume true for n = k i.e. ak = 4A
RTP true for n = k + 1 i.e. ak+1 = 4B,
Proof: From above
an+1 − an = 8(32n−1)
⇒ ak+1 – ak = 8(32k−1)
⇒ ak+1 – 4A = 8(32k−1)
ak+1 = 4A + 8(32k−1)
= 4 [A + 2(32k−1)]

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 15 of 20

= 4B
∴ ak+1 is divisible by 4
Hence by PMI an is divisible by 4
n
5 ∑ 2r(r
r =1
2
− 1)

n n
= 2∑ r 3 − 2∑ r
r=1 r=1
2 2
2n (n + 1) 2n(n + 1)
= −
4 2
n(n + 1)
= [n(n + 1) − 2]
2
n(n + 1) 2
= [n + n − 2]
2
n(n + 1)(n + 2)(n − 1)
=
2
Proof by induction:
n
n(n + 1)(n + 2)(n − 1)
RTP ∑ 2r(r 2 − 1) =
r=1 2
Proof: when n=1, LHS = 2(12 − 1) = 0
(1) (2) (3) (0)
=RHS = 0
2
∴ LHS = RHS
n
n(n + 1)(n − 1)(n + 2)
Hence when n = 1, ∑ 2r(r 2 − 1) =
r=1 2
k
k (k + 1) (k − 1) (k + 2)
Assume true for n = k i.e. ∑ 2r(r 2 − 1) =
r=1 2
k +1
(k + 1) (k + 1 + 1) (k + 1 − 1) (k + 1 + 2)
RTP true for n = k + 1 i.e. ∑ 2r(r 2 − 1) =
r=1 2
k +1
Proof: ∑ 2r(r
r=1
2
− 1)
k

∑ 2r(r 2 − 1) + 2(k + 1) ((k +1)2 − 1)

=
r=1

k(k + 1) (k − 1) (k + 2)
= + 2(k + 1) (k 2 + 2k)
2
k(k +1)
= [(k − 1) (k + 2) + 4(k + 2)]
2
k(k + 1) (k + 2)
= (k − 1 + 4)
2
k(k + 1) (k + 2)(k + 3) (k + 1) (k + 1 + 1) (k + 1 − 1) (k + 1 + 2)
=
2 2
k
n(n + 1) (n − 1) (n + 2)
Hence by PMI ∑r=1
2r(r 2 − 1) =
2
6 an = 52n+1 + 1
an + 1 = 52(n + 1) + 1 + 1
= 52n+3 + 1
an + 1 − an = 52n+3 + 1 − 52n+1− 1

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 16 of 20

= 52n + 3 − 52n + 1
= 52n+1(52 − 1)
= (24) (52n + 1)
RTP: an = 6A, ∀n ≥ 0
Proof: when n = 0, a0 = 51 + 1 = 6 = 6 (1)
Hence when n = 0, an is divisible by 6
Assume true for n = k i.e. ak = 6A
RTP true for n = k + 1, i.e. ak+1 = 6B
Proof: ak+1 − ak = 24(52k+1), from above
⇒ ak+1 – 6A = 6(4) (52k+1)
ak+1 = 6A + 6(4) 52k+1
= 6 [A + 4(52k+1)]
= 6B
Hence by PMI an is divisible by 6. ∀n ≥ 0
n
7 ∑ (6r
r=1
3
+ 2)
n n
= 6∑ r 3 + ∑ 2
r=1 r=1

6n 2 (n + 1) 2
= + 2n
4
n
= [3n(n +1) 2 + 4]
2
n
= (3n 3 + 6n 2 + 3n + 4)
2
n
n
RTP ∑ (6r 3 + 2) = (3n 3 + 6n 2 + 3n + 4)
r=1 2
Proof: n = 1, LHS = 6(1)3 + 2 = 8
1 16
RHS = (3 + 6 + 3 + 4) = = 8
2 2
∴ LHS = RHS
n
n
Hence when n = 1, ∑ (6r 3 + 2) = (3n 3 + 6n 2 + 3n + 4)
r=1 3
k
k
Assume true for n = k, i.e. ∑ (6r 3 + 2)= (3k 3 + 6k 2 + 3k + 4)
r=1 2
k+1
k +1
RTP true for n = k + 1 i.e. ∑ (6r 3 = + 2) (3(k +1)3 + 6(k +1)2 + 3(k +1) + 4)
r=1 2
Proof:
k+1 k

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

k
=
(3k 3 + 6k 2 + 3k + 4) + 6(k +1)3 + 2
2
1
= [3k 4 + 6k 3 + 3k 2 + 4k +12(k 3 + 3k 2 + 3k +1) + 4]
2
1
= [3k 4 +18k 3 + 39k 2 + 40k +16]
2
1
= (k +1) (3k 3 + 15k 2 + 24k +16)
2

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 17 of 20

1
= (k +1)[3(k +1)3 + 6(k +1)2 + 3(k +1) + 4]
2
n
n
Hence by PMI ∑ (6r 3 + 2) = (3n 3 + 6n 2 + 3n + 4)
r=1 2
n
1
8 RTP ∑ (r + 4) = n(n + 9)
r=1 2
Proof:
when n = 1, L.H.S = 1 + 4 = 5
1 10
R.H.S = (1) (1 + 9) = = 5
2 2
∴ LHS = RHS
n
1
when n = 1, ∑ (r + 4) = n(n + 9)
r=1 2
k
1
Assume true for n = k, i.e. ∑ (r + 4) = k(k+9)
r =1 2
k +1
1
RTP true for n = k+1, i.e. ∑ (r + 4) = (k+1) (k + 1 + 9)
r=1 2
k+1 k
Proof: ∑ (r=
r=1
+ 4) ∑ (r + 4) + (k+1+4)
r=1

1
= k(k + 9) + (k + 5)
2
1 2
= [k + 9k + 2k + 10]
2
1 2
= [k + 11k + 10]
2
1
= (k+1) (k+10)
2
1
= (k + 1) (k + 1 + 9)
2
n
1
Hence by PMI ∑ (r + 4) =
r=1 2
n(n + 9)
n
4n (n +1) (n −1)
9 RTP ∑ 4r (r −1) =
r=1 3
Proof:

When n = 1, LHS = 4(1)(1 − 1) = 0

4(1) (1 +1) (1 −1) 4 × 2 × 0
RHS = = = 0
3 3
∴ LHS = RHS
n
4n (n +1) (n −1)
∴ ∑ 4r (r −1) =
r=1 3
k
4k (k +1) (k −1)
Assume true for n = k i.e. ∑ 4r (r −1) =
r=1 3
k +1
4(k +1) (k +1 + 1) (k + 1 − 1)
RTP true for n = k + 1 i.e. ∑ 4r (r −1) =
r =1 3
Proof:

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 18 of 20

k +1 k

∑ 4r (r=
r =1
− 1) ∑ 4r(r − 1) + 4(k + 1)(k + 1 − 1)
r=1

4 k (k + 1) (k − 1)
= + 4(k + 1) (k)
3
4
= (k + 1) k [k − 1 + 3]
3
4
=(k + 1) (k) (k + 2)
3
4
= (k + 1) (k + 1 + 1) (k + 1 − 1)
3
n
4
Hence by PMI ∑ 4r(r − = 1) n(n + 1) (n − 1)
r =1 3
n
1 n
10 RTP ∑ =
r=1 r(r + 1) (n + 1)
Proof:
1 1
when n = 1,= LHS =
1(1 + 1) 2
1 1
= =
RHS
1+1 2
L.H.S = RHS
n
1 n
∴ when n = 1, ∑ =
r=1 r(r + 1) (n + 1)
k
1 k
Assume true for n = k, i.e. ∑ r(r + 1) = (k + 1)
r=1
k +1
1 k +1
RTP true for n = k + 1, i.e. ∑ r(r + 1) = k + 1 + 1
r =1
k+1 k
1 1 1
Proof: ∑
= ∑ +
r=1 r(r +1) r=1 r(r +1) (k +1)(k + 2)
k 1
= +
(k +1) (k +1) (k + 2)
k(k + 2) + 1
=
(k +1) (k + 2)
k 2 + 2k +1
=
(k +1) (k + 2)
(k +1) 2 k +1
= =
(k +1) (k + 2) k + 2
n
1 n
Hence by PMI ∑ r(r +1) = n +1
r=1
n
11 RTP ∑ 3(2
r=1
r −1
) = 3(2n − 1)

Proof:
when n = 1, LHS = 3(21−1) = 3
RHS = 3(21 − 1) = 3
LHS = RHS

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 19 of 20

n
when n = 1, ∑ 3(2
r=1
r −1
) = 3(2n − 1)
k
Assume true for n = k, i.e. ∑ 3(2
r=1
r −1
) = 3(2 k − 1)
k+1
RTP true for n = k + 1, i.e. ∑ 3(2
r=1
r −1
) = 3(2 k+1 − 1)
k+1 k
Proof: ∑ 3(2
r=1
r −1
) = ∑ 3(2 r −1 ) + 3(2 k+1−1 )
r=1

= 3 (2k − 1) + 3 (2k)
= 3[2k – 1 + 2k]
= 3[2 × 2k − 1]
= 3 (2k+1 − 1)
n
by PMI ∑ 3(2
r=1
r −1
) = 3(2n − 1)

12 RTP n (n2 + 5) = 6A, n ∈ ℤ+

Proof:
when n = 1, n (n2 + 5)
2
= 1(1 + 5) = 6
= 6(1)
Hence when n = 1, n (n2 + 5) is divisible by 6
Assume true for n = k, i.e. k (k2 + 5) = 6A
RTP true for n = k +1, i.e. (k+1) ((k + 1)2 + 5) = 6B
Proof:
(k + 1) ((k + 1)2 + 5)
= k ((k + 1)2 + 5) + (k + 1)2 + 5
= k (k2 + 2k +6) + (k2 + 2k + 6)
= k (k2 + 5) + k (2k + 1) + k2 + 2k + 6
= k (k2 + 5) + 3k2 + 3k + 6
= k (k2 + 5) + 3k (k + 1) + 6 Since k (k + 1) is the product of two consecutive integers,
k (k + 1) is an even number and hence divisible by 2
∴ 3k (k + 1) is divisible by 6
= 6A + 6C + 6
= 6 (A + C + 1)
= 6B
Hence by PMI n (n2 + 5) is divisible by 6 for all positive integers n
13 RTP n5 – n = 5A
Proof:
When n = 1, 15 – 1 = 0 which is divisible by 5
Hence when n = 1, n5 – n = 5A
Assume true for n = k i.e. k5 – k = 5A
RTP true for n = k + 1, i.e. (k + 1)5 – (k + 1) = 5B
Proof:
(k + 1)5 – (k + 1)
= k5 + 5k4 + 10 k3 + 10 k2 + 5k + 1 – k − 1
= (k5 – k) + 5 k4 + 10 k3 + 10 k2 + 5 k
= 5 A + 5 (k4 + 2 k3 + 2 k2 + k)
= 5 [A + k4 + 2 k3 + 2 k2 + k]
=5B
Hence by PMI n5 – n is divisible by 5 for any positive integers n

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013

 Page 20 of 20

k
1 1 1
14 RTP ∑ (n + 4) (n + 3)=
n =1
−
4 k+4
Proof:
1 1 1
k = 1, LHS = = =
(1 + 4) (1 + 3) 5 × 4 20
1 1 5−4 1
RHS = − = =
4 5 20 20
LHS = RHS
k
1 1 1
when k = 1, ∑ = −
n =1 (n + 4) (n + 3) 4 k+4
r
1 1 1
Assume true for k = r, i.e. ∑ (n + 4) (n + 3)=
n=1
−
4 r+4
r+1
1 1 1
RTP true for k = r + 1, i.e. ∑ = −
n =1 (n + 4) (n + 3) 4 (r + 1) + 4
r+1 r
1 1 1
=n 1=
Proof:
n 1
∑=
(n + 4) (n + 3)
∑ (n + 4) (n + 3) + (r + 5) (r + 4)
1 1 1
= − +
4 r + 4 (r + 5) (r + 4)
1 (r + 5) − 1 1 r+4 1 1
= − = − = −
4 (r + 5) (r + 4) 4 (r + 4) (r + 5) 4 (r + 1) + 4

Unit 1 Answers: Chapter 3 © Macmillan Publishers Limited 2013