Skill Sets

Chapter 1 Sequences and Series

No. Skills Examples of questions involving the skills
1. Finding terms of a sequence (Lecture Notes Example 4)
given by the recurrence The recurrence relation of a sequence is given by
relation using GC. un1  2un  1 for n  1 and u1  3 .
By keying in the recurrence relation using the sequence
mode, we can find the terms of the sequence easily.

2. Evaluating limits (i) (a)Recurrence formula

(i) algebraically (Lecture Notes Example 7(i))
(ii) using GC The recurrence relation is xn1  xn . To find the limit
of the sequence, we need to use the fact that
when n  , xn  L and xn1  L too.
i.e. xn1  xn
 L L

(b)General formula
Perform long division first before evaluating limits
involving improper fractions.
2n 2  3  1 
lim 2  lim  2  2   2
n n  1 n  n 1 
Alternatively,
 3 
2n 2  3  2  n2 
lim  lim  2
n n 2  1 n
 1  1 
 n2 

1
 (ii) (Lecture Notes Example 6(c))
By keying in the general formula for the sequence,
3n
un  into the GC, we can observe how the sequence
n!
behaves as n increases.

3n
By scrolling down the table, we can see that lim  0.
n  n !

3. Replacement method to
find (i) (Lecture Notes Example 2)
(i) Sn1 from Sn , We replace n by ( n  1 ) in Sn  2n  n2 to
(ii) un1 from un . obtain Sn1  2(n  1)  (n  1)2 .

(ii) Similarly, we replace n by ( n  1 ) in the expression of

un to obtain un1 .

4. Formulate conjecture. (i) (Lecture Notes Example 5(ii))

A sequence is defined by u1  6 and un1  5un  4 .
By considering un  1 , make a conjecture for a formula
for un in terms of n.
n un  1 Pattern

1 5 51
2 25 52
3 125 53
n - 5n

2
5. Prove statements involving
recurrence relation.
6. Give answers in the context
of a problem.
7. Recognize a new sequence
is formed when certain
terms are extracted from a
given sequence.
(Lecture Notes Example 7(iii))
Prove that if 0  xn  1, then xn1  xn .
 We usually work backwards by rearranging the target,
xn1  xn :
 xn  xn
 xn  xn2
 0  xn2  xn
We have changed the target of proving
if 0  xn  1, then xn1  xn to an easier target,
if 0  xn  1, then xn 2  xn  0 . The easier target is an
expression in terms of only one variable, xn .
The above inequality can be easily proven by
sketching the graph of y  xn 2  xn .
(i) (Tutorial 1A Question 5(b))
1
After solving for r  or 1 , the value r  1 is rejected
2
as the question states that GP is convergent.
(ii) (Tutorial 1A Question 9(iii))
After solving the inequality for n , we obtain
5.228  n  13.77 . However, the number of terms, n
must be a positive integer. The final answer should be
given as n   : 6  n  13 .
(Lecture Notes Example 12)
A new sequence is formed using the even-numbered terms
(i.e. u2 , u4 , u6 ,... ) of an AP with first term a and common
difference d.
 The new sequence is also an AP with first term (a  d )
and common difference 2d .
3
8. Formulate mathematical (Tutorial 1A Question 11(ii)(b))
equations or formulae from A second student puts $10 on 1 January 2009 into a bank
a word problem. account which pays compound interest at a rate of 2% per
month on the last day of each month. She puts a further $10
Some methods include into the account on the first day of each subsequent month.
- write out the first few
terms and find the pattern  Let Tn be the total amount of money in the account at the
for the general term end of n months. It is important to interpret the problem
accurately and work out a recurrence relation,
- Recognize AP or GP or
Tn  1.02 Tn1  10  where T1  1.02(10) . From here, we
their sums
can write the first few terms and then form a conjecture
for Tn .
T1  (1.02)(10)
T2  (1.02)[10  (1.02)(10)]  (1.02)(10)  (1.02)2 (10)
T3  (1.02)[10  (1.02)(10)  (1.02) 2 (10)]
 (1.02)(10)  (1.02) 2 (10)  (1.02)3 (10)
1.02(1.023  1)
 (10)
1.02  1
…
(1.02)[(1.02) n  1]
Tn  (10)
(1.02  1)
 (510)[(1.02) n  1]

ALTERNATIVELY,
It is probably easier if we think how much will each $10
earn by the end of 24 months:
1st $10  (10)
nd
2 $10  (10)
rd
3 $10  (10)
…
Last $10  1.02(10)
We can sum all this up by using GP sum.

------------------------------------------------------------------------
A number of other such problems can be found in the lecture
examples 22, 23, 24 and supplementary exercises question
6, 13, 14, 16, 17.

4
9. Method of difference using
partial fractions.  Here is a quick check on partial fractions used for
(Lecture Notes Example 30)
method of difference (only for MOD):
For cancellations of terms to work in the method of
differences, the coefficients of the partial fractions
usually add up to 0.
1 1 1
For the partial fraction   ,
8  2r  1 4  2r  1 8  2r  3
1  1 1
we can see that       0.
8  4 8

 Check that the terms are arranged in ascending order or

descending order before writing out the rows of terms.
This will enable you to cancel with ease.

 Spot the terms for cancellations by looking at the

denominators:
n  

1 1 1
   
r 1  
8 2r  1 4  2r  1 8  2r  3 
1/ 8 1/ 4 1/ 8
  
 (1)  3 5
1/ 8 1/ 4 1/ 8
  
 3  5 7
1/ 8 1/ 4 1/ 8
  
 5 7 9

1/ 8 1/ 4 1/ 8
  
 2n  3  2n  1  2n  1
1/ 8 1/ 4 1/ 8 
   
 2n  1  2n  1  2n  3 
It is easier to spot such trends using the denominators if
one do not simplify the original form of the fractions,
1/ 8 1/ 4 1/ 8 1 1 1
i.e. , , to , , .
5 5 5 40 20 40

5
10. Recognize method of  (Tutorial 1B Question 12)
difference when the 1 1 1 1
Verify that    .
question did not say so. 2 x  x  1 2  x  2  x  x  1 x  2 

N
1
By using the above result, find 
n  3 n  n  1 n  2 
.

N
1 1 N 1 2 1 

n 3 n  n  1 n  2 
     
2 n 3  n  n  1  n  2  
 1 2 1 
 3   
2 1
 
 1 
2

1 
 4 3 2 
 
1 2 1 
1   
  5 4 3 
2 
 
 1 2 1 
 N  1  N  2  N  3 
 
 1 
2

1 
 N N  1 N  2 
This question does not tell you to show by using method
of difference. However, we can observe that a difference
1 1 1
of similar looking terms   is given
2 x  x  1 2  x  2 
which is an indication that method of difference may be
the technique to employ.

 (Tutorial 1B Question 11)

When the question asks you to show a difference
f  r   f  r  1 of a given function, f  r  , it is also an
indication that method of difference may be the
technique to employ.

6
11. Find a "new" sum with the (Tutorial 1B Question 13(iii))
help of a given sum.  r  1  n  1
2 2
n
12 22 32
Two methods: 1. r 1 2r 1
 0  3  4  5  ...  n 1
2 2 2 2
1. Write out the terms
n
r 2 12 22 32 n2

of both sums
 1 2 3 
explicitly and r 1 2
r
2 2 2 2n
compare.
 12 22 32 n2 
2. Replace the variable  4 3  4  5   
in the term of the 2 2 2 2n  2 
sum to get from the
 r  1
2
n 1
new sum to the old  4
one or vice versa. r 2 2r 1
2. Let r  s  1 ,
when r  1, s  2 ; when r  n, s  n  1 . (the start
and end values of the index must be changed
correspondingly too)
r 2 n 1  r  1
2
n


r 1 2
r
  r 1
m2 2
 r  1
2
n 1
 4
2r 1
m2
12. Use found/proven general (Tutorial 1C Question 5)
formula of a sum/sequence n 1 n  n  3
Given that   , show
to show a given inequality. r 1 r  r  1 r  2  4  n  1 n  2 
n  n  3 1 n 1 1
 and deduce that   .
4  n  1 n  2  4 r 1  r  1
3
4

Use of expansion:
 It is difficult to see n  n  3 or  n  1 n  2  is bigger.
However, through an expansion,
n  n  3  n2  3n and  n  1 n  2   n2  3n  2 , we can
observe that n2  3n  n2  3n  2 since n is a positive
n  n  3 n2  3n
integer. Hence,  2  1.
4  n  1 n  2  n  3n  2

 Similarly, through an expansion,

 r  13  r 3  3r 2  3r  1 and
r  r  1 r  2  r 3  3r 2  2r,
we can tell (r  1)3  r (r  1)(r  2) .

7
  It is important to note that for inequality question, we
need to draw the link between what is given. i.e.,
n 1 n  n  3
  and what is to be
r 1 r  r  1 r  2  4  n  1 n  2 
n 1 1
shown,   .
r 1  r  1
3
4

13. Using M.I. to prove the (Lecture notes Example 33, 34, Tutorial 1C Question 3,
general formula of a given 5, 6, 7(iii), 8.)
series.  To prove P(k+1) is true with the assumption that
P(k) is true, we use:
k 1 k
 ur   ur  uk 1 to link up the
r 1 r 1
(Lecture notes Example 33)
k 1 
Assume  r 2  k  k  1 2k  1 for some k  .
r 1 6
k 1
LHS   r 2
r 1
k
  r 2   k  12
r 1
1
 k  k  1 2k  1   k  12
6
 ...

14. Use of M.I. to prove the (Lecture notes Example 35, 36, 37 Tutorial 1C Question
general formula of a given 4, 9, 10.)
sequence.  Note that we are proving the general formula, NOT
the recurrence formula of the given sequence.

 To prove P(k+1) is true with the assumption that

P(k) is true, we use the recurrence formula that is
given in the question:
uk 1  f  uk  .
(Lecture Notes example 35)

Assume uk  2k 1  1 for some k  .
LHS  uk 1
 uk  2k 1
  2k 1  1  2k 1
 ...

8
15. Important to present the Refer to the Lecture Notes Examples:
steps clearly in a M.I.  We will perform the five steps of mathematical
question. induction.

 Step 1: It is important to properly define the

proposition, with range of values of the variable
(usually n) clearly stated.

 Step 3 only assumes P(k) for some values of k and

not for all values of k.

 Step 4: When proving P(k+1), it is important to note

that all steps leading to the final answer which is
RHS must be clearly shown.

 Step 5: The conclusion must clearly state how the

proof is done by the process of mathematical
induction, i.e., "Since P(1) is true and if P(k) is
true, then P(k+1) is true, P(n) is true for all
positive integer values of n".