Summation/Series Notes

Important Results of Summation

1.1

Properties of Summation
n
X

1. Distributive Property:

(f (r) g(r)) =

r=1

NOTE:

rf (r) 6= r

n
X

f (r)

r=1
n
X

2. Factoring out Constants:

n
X

n
X

nf (r) = n

r=1

n
X

n
X

g(r)

r=1

f (r) (Realise n is a constant)

r=1

f (r)

r=1

r=1

3. Changing of Limits:
(a)

n
X

f (r) =

(b)

r=m

f (r)

f (r) =

nk
X

m1
X

f (r) (Splitting of sums)

r=1

r=1

r=m
n
X

n
X

nk
X

f (r + k) =

r+k=m

f (r + k) (IMPORTANT!)

r=mk

(Replacing r by r + k)

1.2
1.

Standard Series
n
X

a = na where a is a constant. (*)

6.

r=1

2.

n
X

r=1

r=

r=1

3.

n
X

n
X

n(n + 1)
(*)
2

r2 =

r=1
n
X

n
X

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

n
X
n2 (n + 1)2
4.
r =
=(
r)2
4
r=1
r=1

a(1 rn )
5.
a =
(This is a GP)
1r
r=1

ln r = ln(1 2 3... n) = ln(n!)

1.3

Relating Series and terms of Series

1. Finding Sn from Tn
When given Tn , one obtain Sn simply by taking summation of Tn and applying the
formulae from Standard Series. The following example illustrates this:
N
X
2
2
Given Tn = (3n 1)(2n + 1) 3n +
, find
((3n 1)(2n + 1) 3n +
)
n(n + 1)
n(n
+
1)
n=10
N
X

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

n=10
N
X

N
X

n=10

n=10

(3n 1)(2n + 1)

N
X

(3n + n 1)

2
)
n(n + 1)
n

3 +

N
X

2
(Distributive property)
n(n + 1)
n=10

N
X

n=10

1
n(n + 1)
| n=10 {z
}

n=10

{z

Expand out into Standard Series

| {z }

Apply GP formula

N
X

Factor constant out, not Standard Series Apply MOD

N
N
9
N
9
X
X
X
X
X
3n ) + (
= ( (3n2 + n 1)
(3n2 + n 1)) (
3n

|n=1

n=1

n=1

n=1

{z

Break up the sum since lower limit is not 1

n=1

2. Finding Tn from Sn
When given Sn , one obtain Tn by: Tn = Sn Sn1
For example:
Given u1 + u2 + u3 + ... + un1 + un = 42n+1 4, we want to find un .
Realize that Sn = 42n+1 4, and Tn = Sn Sn1 ,
Tn = (42n+1 4) (42(n1)+1 4)
| {z } |
{z
}
Sn

Sn1

Tn = 42n+1 42n1 = 42n1 (16 1) = 15(42n1 )

1.4

Representing series in summation form

This is best illustrated using an example:

Using the series:
n
X
r=1

n
1
=
for any real constant k. (DHS09 JC1)
(kr + 1 k)(kr + 1)
kn + 1

Example:

X
1
1

)
n(n + 1) n=1 n(n + 1)
}

Evaluate:

1
1
1
1
1
1
1
1
+
+
+
+ ... +
+
+
+
13 14 35 47
37 39 55 58 39 41 58 61

By observing the first 2 terms and tallying with the rest of the terms, there seems to be a
pattern break The required sum comprises of 2 separate sums.
Grouping related terms together:
common difference of 2 k=2

}|

common difference of 3 k=3

}|
{
1
1
1
1
1
1
1
1
Required Sum = (
+
+ ... +
+
)+(
+
+ ... +
+
)
13 35
37 39 39 41
14 47
55 58 58 61
20
20
=
+
(There are 20 terms in each sum n = 20)
20 2 + 1 20 3 + 1
2040
=
2501
Note that:
One can find n = 20 by equating the last number (the term in the box below) in the denomi1
.
nator in the last fraction of each sum with
(kr + 1 k) (kr + 1)
For the first sum, equate kr + 1(with k = 2) to 41 r = 20.
Since r starts from 1, n = 20.
Similarly, doing the same for the second series, one obtains n = 20 as well.

Method of Difference (MOD)

Apply MOD when facing summation of terms expressible in the format of: uk uk1 , such as
(but not limited to):
1. Fractional terms involving partial fractions
2. Factorial terms
3. Trigonometric terms
4. Finding nth term of a sequence defined recursively
There will be examples each to illustrate MOD in each of the corresponding cases.
Example 1(i): (Partial fractions)
Find

n
X
r=1

2
.
(r + 1)(r + 2)(r + 3)

2
using partial fractions.
(r + 1)(r + 2)(r + 3)
2
1
2
1

+
(r + 1)(r + 2)(r + 3)
r+1 r+2 r+3

1. Step 1: Split

2. Step 2: Compute the sum by writing out first few lines (how many lines depends on the
clarity of the cancellation pattern) and the last two/three lines.
3

n
X
r=1

1 2 1
2
= + 
(r + 1)(r + 2)(r + 3) 2 3 4
1 2 1
=  + 
3 4 5
1 2 1
=  + 
4
5
6
1 2 1
=  + 
6
7
5
..
. (Here, the cancellations occur 3 terms diagonally)
1
2
1
 +
n1 n
n+1

2
1
1
+
=
n
n+1 n+2

1
2
1
=

+
n+1 n+2 n+3
1
2
1
1 2 1

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

= +
6 n+3 n+2
=

IMPORTANT: Do not simplify the fractions - as the cancellations occur usually by virtue
of its denominator (of course, there are exceptions)
GENERAL RULE:
When the cancellations occur in a diagonal straight line, then writing the first 3 trows and the
last 2 rows of the series would suffice. On the other hand, if the cancellations do not occur in
a straight line (i.e. the cancellation pattern is less obvious),then writing first 4 (maybe 5) and
last 3 rows is necessary.
The next example exemplifies this.
Example 1(ii):
n
X
3r
Find
in terms of n.
r(r + 1)(r + 3)
r=2
By using partial fractions:
3r
1
2
1
=
+
r(r + 1)(r + 3)
r r+1 r+3
Writing the sum out:
n
X
1
2
1
(
+
)
r r+1 r+3
r=2

1 2 1
= + 
2 3 5
1 2 1
= + 
3 4 6
1 2 1
=  + 
4 5 7

1 2 1
=   +  (This is the first row that is fully cancelled)
6
8
5
..
. (Once the first complete row is fully cancelled, we can proceed to write the last few rows)
1
2
1

+
(From the cancellation pattern, write the last 3 rows)
n2 n1 n+1
1
2
1
=
 +
n1 n
n+2

2
1
1
+
= 
n
n+1 n+3

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

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

+
+
12 n + 1 n + 2 n + 3
=

Example 2: (factorials)
By first showing that (r2 + 1)r! r(r + 1)! (r 1)r!, evaluate the series 5(2!) + 10(3!) +
17(4!) + ... + (n2 + 1)n!.
Solution:
1. Starting from the more complicated R.H.S,
(r+1)!=(r+1)r!

z }| {
R.H.S = r(r + 1)! (r 1)r! = r!( r (r + 1) (r 1))
= r!(r2 + r r + 1)
= r!(r2 + 1) = L.H.S
2. Next, represent 5(2!) + 10(3!) + 17(4!) + ... + (n2 + 1)n! in summation form
n
X
5(2!) + 10(3!) + 17(4!) + ... + (n2 + 1)n! =
(n2 + 1)n!
r=2

n
X
r=2

(r + 1)r! =

n
X

(r(r + 1)! (r 1)r!)

r=2

 (1)2!
=
2(3!)

 (2)3!
+
3(4)!

 

+
4(5)!
(3)4!
..
.

+n(n + 1)! 
(n1)n!
=n(n + 1)! 2
uk uk1

}|
{
z
NOTE: Another useful expression: r(r!) = (r + 1 1)r! = (r + 1)r! r! = (r + 1)! r!
Example 3: (Trigonometric expressions)
By first proving that: sin(r + 12 ) sin(r 12 ) 2 cos r sin 12 , find a formula for:
5

n
X

cos r in terms of sin(n + 12 ) and sin 21 .

r=1

Solution:
From MF15, using sin(A B) = sin A cos B cos A sin B, we have:
1
1
sin(r + ) sin(r )
2
2
1
1
1
1
=(sin r cos + cos r sin ) (sin r cos cos r sin )
2
2
2
2
1
=2 cos r sin
2
From the proven identity above:
cos r =

sin(r + 12 ) sin(r 21 )
2 sin 12

Taking summation on both sides yields:

n
X

n
X
sin(r + 12 ) sin(r 21 )
cos r =
2 sin 12
r=1
r=1

Consider

n
X

1
1
(sin(r + ) sin(r )):
2
2
r=1
n
X

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


1
3
= sin sin
2
 2


5
3
+ sin sin
 2
 2
..
.

1
1


)
+ sin(n + ) sin(n

2
2

1
1
= sin(n + ) sin
2
2
1
Since 2 sin 2 is independent of r (meaning a constant), factoring it out gives:


n
n
X
X
sin(r + 12 ) sin(r 21 )
1
1
1
=
(sin(r + ) sin(r ))
1
1
2
2
2 sin 2
2 sin 2 r=1
r=1

n
X
r=1

cos r =

sin(n + 21 ) sin 12
2 sin 12

Example 4: (Finding un when {un } is defined recursively)

Given that ur = ur1

1
5
with u0 = , find un .
r(r + 1)
2

Steps:

1. ur = ur1

1
1
ur ur1 =
r(r + 1)
r(r + 1)

2. |Take summation
{z on both sides} : i.e.
lower limit MUST be the same

n
X

ur ur1 =

r=1

n
X
r=1

1
r(r + 1)

3. Apply MOD to both sides, realize that:

L.H.S =

n
X

ur ur1 =
u1 u0

r=1

=u2 
u1
..
.

 
un2
un1
=

=un 
un1
=un u0 (after all the cancellations)
For the R.H.S, applying the method of partial fractions as illustrated earlier, one obtains:
n
X
1
1
1
R.H.S =
=
r(r + 1)
2 n+1
r=1
4. Combining the results, un will be:
1
1

2 n+1
5
1
(Since u0 = )
un = 3
n+1
2
un u0 =

Common exam questions following MOD

3.1

Sum to infinity

We say that a sum converges when the sum tends to some finite number (i.e. the sum to infinity
exist)
n
X

2
1
1
1
= +

(r + 1)(r + 2)(r + 3)
6 n+3 n+2
r=1
1
1
Here,
0 and
0 as n
n {z
+2
|n + 3
}
For instance:

Need to present this step when stating sum to infinity

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

X
n(n + 1)
Note: Series such as
r does not exist (i.e. the series diverges) since
as
2
r=1
n

3.2

Finding the sum of another series from the existing series

This is best done using the change of limits property:

n
nk
nk
X
X
X
f (r) =
f (r + k) =
f (r + k)
r=m

r+k=m

r=mk

For example:
n
2n
X
X
(1)r (r + 2)
(1)n
(1)r r
Given that
= 1 +
, find
. (AJC10 JC1)
(r
+
1)!
(n
+
1)!
(r

1)!
r=1
r=9
Step 1:
2n
X
(1)r r
(1)r (r + 2)
(1)r r
, we will proceed to change
into
by reStarting from
(r 1)!
(r 1)!
(r + 1)!
r=9
placing r in the former by r + 2 to obtain the same expression as the latter (by using the
change of limits property of summation sign). i.e :
2n
X
(1)r r
replace r by r + 2
(r

1)!
r=9

2(n1)

X (1)r+2 (r + 2) 2(n1)
X (1)r (r + 2)
=
(r + 1)!
(r + 1)!
r+2=9
r=7

Step 2:
2(n1)

X (1)r (r + 2)
as follows (once again, using change of limits
(r
+
1)!
r=7

Proceed to evaluate
property (i)):
2(n1)

6
X (1)r (r + 2) 2(n1)
X (1)r (r + 2) X
(1)r (r + 2)
=

(r + 1)!
(r + 1)!
(r + 1)!
r=7
r=1
r=1

(1)2(n1)
(1)6
(1 +
) (Note that: (1)2(n1) = 1)
(2(n 1) + 1)!
(6 + 1)!
1
1

=
(2n 1)! 5040
= 1 +

3.3

Finding an inequality relating 2 summations

This is tackled by relating the expression of the 2 summations.

The general idea is this:
To prove that a series

n
X

ar < c where c is a constant, we will relate it to the sum of in-

r=1

finity of another series

n
X

bn (usually from an earlier part in the question), thus the relation

r=1

flows in the following manner:

Lower limit MUST be the same

z
n
X
r=n0

ar <

}|
n
X
r=n0

br <

br 0 ar br for all r n0

r=n0

The idea of the prove is to show that:

ar < br for all r n0
n
n
X
X

ar <
br
r=1

r=1

Lets see this principle at work in the example below:

Example:
Given the expression
n
X
r=1

n
X
r=1

n(n + 3)
1
=
, we want to deduce that:
r(r + 1)(r + 2)
4(n + 1)(n + 2)

1
1
< (C Math 9233 Nov 2002)
3
(r + 1)
4
a

z }|r {
z
}|r
{
1
1
1
1
with
by showing that
<
.
Step 1: Compare
3
3
(r + 1)
r(r + 1)(r + 2)
(r + 1)
r(r + 1)(r + 2)
This is done as follows:
We will do some scratchwork by assuming the truth of the statement and attempt to
work backwards (so that we are able to see that: ar < br ):
1
1
<
(r + 1)3 > r(r + 1)(r + 2)
3
(r + 1)
r(r + 1)(r + 2)
(r + 1)2 > r(r + 2) (Cancellation of r + 1 is valid since r 1)
r2 + 2r + 1 > r2 + 2r (This is obviously true for all r)

Thus a good place to start by showing the required statement will be from the last step
in our scratchwork.
For all r, r2 + 2r + 1 > r2 + 2r (r + 1)2 > r(r + 2)
(r + 1)3 > r(r + 1)(r + 2) (Multiply r + 1 on both sides)
1
1

<
3
(r + 1)
r(r + 1)(r + 2)
Step 2: The next step is to chain together, the inequalities relating the summations together:

1
1
<
3
(r + 1)
r(r + 1)(r + 2)
n
n
X
X
1
1

(Taking summation on both sides)

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

Since

n
X

X
X
1
1
1
<
<
3
(r + 1)
r(r + 1)(r + 2)
r(r + 1)(r + 2)
r=1
r=1

r=1

Now

X
r=1

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

1 + n3
n2 + 3n
lim
= lim
n 4n2 + 12n + 8
n 4 + 12 +
n
n

X
X
1
1
Since
<
3
(r + 1)
r(r + 1)(r + 2)
r=1
r=1

n
X
r=1

8
n2

1
4

1
1
<
3
(r + 1)
4

NOTE: We can apply this method of comparing inequalities only when the upper and lower
limits of the summation are the same. In the case where we are relating 2 summations with
different limits (usually the lower limit), we have to split up the summation. This is highlighted
in the next example:
Example:
Given

n
X
r=3

X
1
1
1
1
11
=
, to show that
<
(MJC08)
3
r(r 1)(r 2)
4 2N (N 1)
r
8
r=1

Solution:
a

n
n
z}|{
z
}|
{
1
1
Here, we shall compare 3 and
for r 3.
r
r(1)(r 2)
Once again by working backwards:

Assuming this is true

}|
{
z
1
1
<
r2 > (r 1)(r 2)
r3
r(r 1)(r 2)
Thus, a good point to start to justify that

0| > 3r
{z + 2}

which is true for r 3

1
1
<
would be:
3
r
r(r 1)(r 2)

3r + 2 < 0 r2 3r + 2 < r2 (r 1)(r 2) < r2

1
1
r(r 1)(r 2) < r3
> 3
r(r 1)(r 2)
r

10

Next, we relate the inequalities together:

1
1
<
r3
r(r 1)(r 2)

n
n
X
X
X
1
1
1
1
<
=
(Make sure the lower limit is the same)
<

3
r
r(r 1)(r 2)
r(r 1)(r 2)
4
r=3
r=3
r=3

n
X
1
1
1
1
+
(
<
+
)
3
3
3
r
4
1
2
{z
}
|r=1
Add the first 2 terms of

11
8

1
on both sides of inequality
r3

11