TEMASEK JUNIOR COLLEGE

2022 JC 1 H2 MATHEMATICS (9758)

SEQUENCES AND SERIES

Tutorial 3: Sigma Notation and Method of Difference

[POYO Solution]
k
( )
30
1
2
By making use of the result  r =
k
(k + 1)(2k + 1) , evaluate r 2 − 4 .
r =1 6 r =11
[Use a GC to check your answer]
[Solution]
30 30 30

 (r
r =11
2
− 4) =  r 2 −  4
r =11 r =11
30 10 30
=  r2 −  r2 −  4
r =1 r =1 r =11

30
= ( 31)( 61) − 10 (11)( 21) − 20 ( 4 )
6 6
= 8990

3r − 2 3 r −1
1 1
2 The rth term, u r , of a series is given by u r =   +  .
3  3
n
 B 
(i) Express  u r in the form A1 − n  , where A and B are constants.
r =1  27 
(ii) Find the sum to infinity of the series.

[Solution] Alternatively,
3r − 2 3 r −1 3r − 2 3 r −1
1 1 1 1
(i) ur =   +  ur =   + 
3  3 3  3
3 r −1
3r − 2 1
1
= 
 1 =  ( 3 + 1)
1 +  3
3  3 3 r −1
3r − 2 1
41 = 4 
=   3
33
3 r −1 r
n
1
n n
 1 
n


r =1
ur =  4  
r =1  3 
= 12 3
r =1
−3 r
= 12  
r =1  27 

 1   1  
n

12   1 −   
 27    27  
=
1
1−
27
6 1 
= 1 − n 
13  27 
 6
Hence, A = and B = 1
13

n
1 6 6
(ii) As n →  ,
27n
→ 0 and so u
r =1
r →
13
(1 − 0 ) =
13

6
i.e. sum to infinity =  ur =
r =1 13
 
 1 
3 Without using a graphic calculator, find   10
r =1
3r 

, expressing your answer as a
• •
fraction in its lowest terms. Hence, express the recurring decimal 0  10 8 as a
fraction in its lowest terms.

[Solution]
 r
 1    1 
  3r  =   3 
r =1  10  r =1  10 
1 1
= 3+ 6+ this is an infinite geometric series
10 10
1 1 a
=  use S =
1000 1 − 1000
1
1= r
1
=
999

• • 108 108
0  10 8 = 0.108108108 = + +
1000 1000000
 1 1 
= 108  3 + 6 + 
10 10 
1
= 108  using above result
999
4
=
37
4 An athlete hopes to represent Singapore at the SEA Games in 2019 and he embarks
on a rigorous training programme.
For his first training session, he ran a distance of 7.5 km. For his subsequent training
sessions, he ran a distance of 800 m more than the previous training session.
(i) Express, in terms of n, the distance (in km) he ran on his nth training session.
(ii) Find the minimum number of training sessions required for him to run a total
distance of at least 475 km.

After a month, he realised that his progress was unsatisfactory and he decided to
modify the training. For the modified training programme, he ran a distance of x km
for the first session, and on each subsequent training session, the distance covered is
6
times of the previous session.
5
(iii) Find x, to the nearest integer, if he covered a distance of 14.93 km on the 6th
training session.
(iv) Using the answer in (iii), and denoting the total distance after n training sessions
by Gn, write down an expression for Gn in terms of n.
N
Hence show that  Gn may be expressed in the form aGN + bN, where a and b
n =1
are integers to be determined.
[Solution]
Let An denote the distance ran on the nth training session
and Sn denote the total distance ran for the n training sessions.

(i) An = 7.5 + 0.8(n − 1) = 6.7 + 0.8n

(ii) Sn  475
n
 2(7.5) + 0.8(n − 1)  475
2
7.1n + 0.4n2  475

From GC, n = 26.7 Thus the least value of n = 27

(iii) For the modified training session:

Let Bn denote the distance ran on the nth training session
and Gn denote the total distance ran for the n training sessions.

B6 = 14.93
x(1.2)5 = 14.93
x = 6 (nearest integer)

= 30 ( 65 ) − 1
n
(iv) Gn =
 

 30( ) 
N N
 Gn = 6 n
5
−1
n =1 n =1

 ( ) − 30
N N
6 n
= 30 5
n =1 n =1

=
30  6
5 ( ) − 1 − 30 N
6 N
5
=   N

6 30 ( 65 ) − 1 − 30 N = 6GN – 30N
6
5 −1
 4 1 1
5 (i) Prove that = − .
( 2r − 1)( 2r + 1)( 2r + 3) ( 2r − 1)( 2r + 1) ( 2r + 1)( 2r + 3)
(ii) Find the sum of the first n terms of the series
1 1 1
+ + + ...
(1)( 3)( 5) ( 3)( 5)( 7 ) ( 5)( 7 )( 9 )
(iii) Hence determine whether the infinite series in part (ii) converges.

[Solution]
1 1
(i) RHS = −
( 2r − 1)( 2r + 1) ( 2r + 1) ( 2r + 3)
( 2r + 3) − ( 2r − 1)
=
( 2r − 1)( 2r + 1) ( 2r + 3)
4
= = LHS (shown)
( 2r − 1)( 2r + 1) ( 2r + 3)

1 1 1
(ii) + + + ... + nth term
(1)( 3)( 5) ( 3)( 5)( 7 ) ( 5)( 7 )( 9 )
n
1 1 n  1 1 
= =  −
( )( )(
r =1 2r − 1 2 r + 1 2 r + 3
) 4 r =1  ( 2r − 1)( 2r + 1) ( 2r + 1) ( 2r + 3) 
1 1 1
=  −
4  (1) ( 3) ( 3)( 5 )
1 1
+ −
( 3)( 5 ) ( 5 )( 7 )
+
1 1 
+ −
( 2n − 1)( 2n + 1) ( 2n + 1)( 2n + 3) 
1 1 1 
= −

4  3 2n + 1 2n + 3 
( )( )

1 n
1 11 1
(iii) As n → ,
( 2n + 1)( 2n + 3)
→ 0,  ( 2r − 1)( 2r + 1) ( 2r + 3) → 4  3  = 12
r =1

1 1
Thus  ( 2r − 1)( 2r + 1) ( 2r + 3)
r =1
converges to
12
 n
n(n + 1)(2n + 1)
6 It is given that r
r =1
2
=
6
.

(i) Verify that (r + 1)2 r2 (2r + 1) − r2(r −1)2(2r − 1) = 10r4 + 2r2.

n 1
(ii) Hence prove that  r 4 = n(n+1)(2n+1)(3n2 + 3n − 1).
r =1 30
[Solution]

(i) ( r + 1)2 r 2 ( 2r + 1) − r 2 ( r − 1)2 ( 2r − 1)

= 2r 3 ( r + 1) − ( r − 1)  + r 2 ( r + 1) + ( r − 1) 
2 2 2 2

= 2r 3  4r  + r 2 ( 2r 2 + 2 )
= 10r 4 + 2r 2 (verified)

n n

 (10r 4 + 2r 2 ) =  ( r + 1) r 2 ( 2r + 1) − r 2 ( r − 1) ( 2r − 1)

2 2
(ii)
r =1 r =1

 22 (1)2 ( 3) − 12 ( 0 )2 (1) 
 
 + 32 ( 2 ) ( 5 ) − 22 (1) ( 3) 
2 2
n n
 
10 r + 2 r = 
4 2

r =1 r =1
 + n 2 ( n − 1)2 ( 2n − 1) − ( n − 1)2 ( n − 2 )2 ( 2n − 3) 
 
 + ( n + 1)2 n 2 ( 2n + 1) − n 2 ( n − 1)2 ( 2n − 1) 
 
n n
10 r 4 + 2 r 2 = ( n + 1) n 2 ( 2n + 1) − 0
2

r =1 r =1

n
2n
10 r 4 + ( n + 1)( 2n + 1) = ( n + 1)2 n 2 ( 2n + 1)
r =1 6
n
1  2 n 
 r = n ( n + 1) ( 2n + 1) − ( n + 1)( 2n + 1) 
4 2

10  3 
r =1

n ( n + 1)( 2n + 1)
= 3n ( n + 1) − 1
30
= ( n + 1)( 2n + 1) ( 3n 2 + 3n − 1)
n
30
 1
7 If f(r) = , simplify f(r) − f(r −1).
r2
3 5 7
Hence find the sum of the first n terms of the series 2 2
+ 2 2
+ + ...
1 2 2 3 2
3 42
Show that the series converges and find its limit.
[Solution]
r 2 − ( r − 1) 2r − 1
2
1 1
f ( r ) − f ( r − 1) = 2 − = − =−
r ( r − 1) 2
r ( r − 1)
2 2
( r − 1)2 r 2

3 5 7 n +1
2r − 1
+ 2 2+ 2 2+ + n th term = 
r = 2 ( r − 1) r
2 2 2 2
12 23 34
n +1
=   f ( r − 1) − f ( r )
r =2

= f (1) − f ( 2 )
+ f ( 2 ) − f ( 3)
+
+ f ( n ) − f ( n + 1)

= f (1) − f ( n + 1)
1
=1−
( n + 1)2
1
As n →  , → 0 and so sum to n terms → 1
( n + 1)!

 sum to infinity = 1
 k
8
2
It is given that  r =
k
(k + 1)(2k + 1) for k  +
.
r =1 6

By first expressing the following series in sigma notation form, find the sum of each
of the following series
12 + 2 2 + 32 + ...... + (2n )
2
(i)

2 2 + 4 2 + 6 2 + ...... + (2n )
2
(ii)

Hence find 12 + 32 + 5 2 + ...... + (2n − 1) .

2

[Solution]
2n
12 + 2 2 + 32 + ...... + (2n ) =  r 2
2
(i)
r =1

2n
= ( 2n + 1)( 4n + 1)
6
n
= ( 2n + 1)( 4n + 1)
3
n n
2 2 + 4 2 + 6 2 + ...... + (2n ) =  ( 2r ) = 4 r 2
2 2
(ii)
r =1 r =1

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

Hence 12 + 32 + 52 + + ( 2n − 1)
2

= (12 + 22 + 32 + + ( 2n ) ) − ( 2 2 + 4 2 + 6 2 + + ( 2n ) )
2 2

n 2n
= ( 2n + 1)( 4n + 1) − ( n + 1)( 2n + 1)
3 3
n ( 2n + 1)
= ( 4n + 1 − 2n − 2 )
3
= ( 4n 2 − 1)
n
3
 n
r+2 1 1
9 Let S n =  (−1) r . By considering + , find Sn in terms of n.
r =1 (r + 1)! r ! (r + 1)!
Hence deduce that S2n + 1 < −1 < S2n for all n  1.
[Solution]

1 1 ( r + 1) + 1
+ =
r ! ( r + 1) ! ( r + 1)!
r+2
=
( r + 1)!
n
r+2 n
1 1 
Sn =  (−1) r =  (−1) r  + 
r =1 (r + 1)! r =1  r ! (r + 1)!
 1 1
=  − −
 1! 2!
1 1
+ +
2! 3!
1 1
− −
3! 4!

+
1 ( )n 1
+ ( −1) + −1
n

n! (n + 1)!
1
= ( −1) −1
n

( n + 1)!

1 1
Now S2 n +1 = ( −1)2 n +1 since ( −1) = −1
2 n+1
− 1 = −1 −  −1
( 2 n + 2 )! ( 2 n + 2 )!

1 1
since ( −1) = 1
2n
And S2 n = ( −1)2 n − 1 = −1 +  −1
( 2n + 1)! ( 2n + 1)!

Thus S2 n +1  −1  S2 n
 1 1
10 By considering n −1
− (a is positive and a  1), show that
1+ a 1+ an
N a n−1 1 1 1 
 = − .
n =1 (1 + a
n −1
)(1 + a n ) a − 1  2 1 + a N 
N 2n −1 1
Deduce that  n −1
 .
n =1 (1 + 2 )(1 + 2 ) 2
n

[Solution]
1 1 1 + a n − 1 − a n −1
− =
1 + a n −1 1 + a n (1 + a n −1 )(1 + a n )
a n −1 ( a − 1)
=
(1 + a n−1 )(1 + a n )

N
a n −1 ( a − 1) N
 1 1 
 =   −
n =1 (1 + a
n −1
)(1 + a ) n =1 1 + a
n n −1
1 + a n 
N
a n −1 1 1 1
 =  −
n =1 (1 + a )(1 + a ) a − 1  2 1 + a
n −1 n

1 1
+ −
1 + a 1 + a2
+
1 1 
+ −
1+ a N −1
1 + a N 

1 1 1 
=  − 
a −1 2 1 + aN 

Let a = 2
N
2n −1 1 1

n =1 (1 + 2
n −1 n
= −
)(1 + 2 ) 2 1 + 2 N
1 1
 since 2 N  0  0
2 1 + 2N
Optional questions
5 Express the general term of each of the following series in partial fractions and
deduce its sum to n terms:

1 3 5 3 5 
(a) + + + ... 1
 4 + 2(n + 1) − 2(n + 2) 
1 2  3 2  3  4 3  4  5  

n
4r
(b)  (2r − 1)(2r + 1)(2r + 3)
r =1
1 1 3 
 2 − 4(2n + 1) − 4(2n + 3) 
 

2 3 4 5 1 n +1 
(−1)
(c) − + − + ...  + 
3  5 5  7 7  9 9 11 12 4(2n + 3) 

[Solution]
1 3 5 n
2r − 1
(a) + + + ...+ nth term = 
1 2  3 2  3  4 3  4  5 ( )(
r =1 r r + 1 r + 2
)
n
 1 3 5 
=  − + −
r =1  2r r + 1 2 r + 2 
( )
 1 3 5
= − + −
 2 2 6
1 5
− +1−
4 8
1 3 1
− + −
6 4 2
+
1 3 5
− + −
2 ( n − 2 ) n − 1 2n
1 3 5
− + −
2 ( n − 1) n 2 ( n + 1)
1 3 5 
− + −
2n n + 1 2 ( n + 2 ) 
3 1 5
= + −
4 2 ( n + 1) 2 ( n + 2 )

n
4r n
 1 1 3 
(b) 
r =1
=  + −
(2r − 1)(2r + 1)(2r + 3) r =1  4 ( 2r − 1) 2 ( 2r + 1) 4 ( 2r + 3) 
1 1 3
= + −
 4 6 20
1 1 3
+ + −
12 10 28
1 1 1
+ + −
20 14 12
+
1 1 3
+ + −
4 2n − 5 2 2n − 3 4 2n − 1)
( ) ( ) (
1 1 3
+ + −
( 2n − 3) 2 ( 2n + 1) 4 ( 2n + 1)
 1 1 3 
+ + −
4 ( 2n − 1) 2 ( 2n + 1) 4 ( 2n + 3) 
1 1 3
= − −
2 4 ( 2n + 1) 4 ( 2n + 3)

2 3 4 5
(c) − + − + …+ nth term
3  5 5  7 7  9 9 11
n +1 ( −1)r r n +1
r  1 1 
= =  ( −1)  +
( )(
r = 2 2r − 1 2r + 1
) r =2  4 2r − 1 4 2r + 1 
( ) ( )
1 n +1 ( ) r  1 1 
= 
4 r =2
−1  +
 2r − 1 2r + 1 
1 1 1
=  +
4 3 5
1 1
− −
5 7
+
n +1 1 n +1 1 
+ ( −1) + ( −1)
2n − 1 2n + 3 
1 ( −1)n +1
= +
12 4 ( 2n + 3)

3 2 1 16r + 16
6 (i) Show that − − = .
2r − 1 2r + 1 2r + 3 (2r − 1)(2r + 1)(2r + 3)
n r +1
(ii) Hence find  , giving your answer in the form
r =1 (2r − 1)(2r + 1)(2r + 3)
k – f(n), where k is a constant.

State the sum to infinity of the series in which the rth term is
r +1 5 3 1 5
.  − − ; 
(2r − 1)(2r + 1)(2r + 3)  24 16 ( 2 n + 1) 16 ( 2 n + 3 ) 24 

[Solution]
3 2 1
(i) − −
2r − 1 2r + 1 2 r + 3
3 ( 2r + 1) ( 2r + 3) − 2 ( 2r − 1) ( 2r + 3 ) − ( 2r − 1)( 2 r + 1)
=
( 2r − 1)( 2r + 1) ( 2r + 3)
3 ( 4r 2 + 8r + 3) − 2 ( 4r 2 + 4r − 3) − ( 4r 2 − 1)
=
( 2r − 1)( 2r + 1) ( 2r + 3)
16r + 16
= (shown)
( 2r − 1)( 2r + 1) ( 2r + 3)

n
16r + 16 n
 3 2 1 
(ii)  ( 2r − 1)( 2r + 1) ( 2r + 3) =   2r − 1 − 2r + 1 − 2r + 3 
r =1 r =1

n
r +1  2 1
 16 = 3 − −
r =1 2 r − 1 2 r + 1 ( 2 r + 3 )
( )( )  3 5
 2 1
+1 − −
5 7
3 2 1
+ − −
5 7 9
+
3 2 1
+ − −
2n − 5 2n − 3 2n − 1
3 2 1
+ − −
2n − 3 2 n − 1 2 n + 1
3 2 1 
+ − −
2n − 1 2n + 1 2n + 3 
n
r +1 5 3 1
 = − −
r =1 2r − 1 2r + 1 ( 2r + 3 ) 24 16 ( 2n + 1) 16 ( 2n + 3 )
( )( )

1 1
As n → , → 0 and → 0,
2n + 1 2n + 3
n
r +1 5
 →
r =1 2r − 1 2 r + 1 ( 2 r + 3 )
( )( ) 24


r +1 5
 =
r =1 2r − 1 2r + 1 ( 2r + 3 )
( )( ) 24