Telescoping Sums

Dr. Philippe B. Laval

Kennesaw State University

Abstract
This hand out is a description of the technique known as telescoping
sums, which is used when studying the convergence of some series.

1
1.1

Telescoping sums
Introduction

1
i (i + p)
i=1
where p is some positive integer. It is used when we are studying the convergence

1
of these series. For example, we would use it to study the series
,
i (i + 1)
i=1

1
1
,
, ... It involves two steps. First, we write the general
i
(i
+
2)
i
(i
+ 3)
i=1
i=1
term of the series as a dierence of two fractions, using partial fraction decomposition. Second, we nd and simplify the sequence of partial sums, as most of
its terms will cancel.
The technique we are about to describe applies to series of the form

Partial Fraction Decomposition.



1
1
1
1 1
1
Theorem 1
=

i (i + p)
ip p (i + p)
p i
i+p
Proof. This is easily done using the techniques of partial fraction decomposition. First, we notice that
A
B
1
= +
i (i + p)
i
i+p

(1)

If we multiply each side by the denominator of the fraction on the left, we obtain
1 = A (i + p) + Bi

When i = 0, we obtain
Ap = 1
1
A =
p
When i = p, we obtain
Bp = 1
B

1
p

Replacing those values in equation 1 gives the desired result.

Example 2 If p = 1, we have
1
1
1
=
i (i + 1)
i
i+1
Example 3 If p = 2, we have
1
1
=
i (i + 2)
2
Example 4 If p = 3, we have
1
1
=
i (i + 3)
3

1
1

i
i+2
1
1

i
i+3

Simplifying the Sequence of Partial Sums




1
1 1
1
Instead of studying
, we study

. In fact, bei (i + p)
p i
i+p
i=1
i=1




1
1
cause we will prove that

converges, it is enough to study

i
i+p
i=1




1
1

since
i
i+p
i=1

1 1
i=1

We now concentrate on

1
i+p




1

i
i=1
partial sums, (Sn ). By denition,
Sn =

1

p i=1

1
1

i
i+p

(2)


1
. To study it, we use its sequence of
i+p

n 


1
i=1

i
i+p

We rst look at the special cases p = 1 and p = 2. We then generalize our result
for any positive integer p.
2

3.1

Case p = 1

In this case,
Sn =

n 


1
i=1

i
i+1

1
1
The key here is to notice that and
will generate the same values with
i
i+1
opposite signs. Hence, they will cancel. Of course, these same values will be
generated for dierent values of i. More precisely, they will generate the same
1
values for values of i which are 1 unit apart. For a certain value of i, generates
i
1
generated for the previous value of i. For example,
the same value that
i+1
1
1
1
when i = 4,
=
which is the same value that
gives when i = 3.
i
4
i+1
1
This means that everything will cancel except the value generated by for the
i
1
for the ending value of i. When
starting value of i, and the last value of
i+1
1
1
= 1 when i = 0, but i is never 0. Similarly, when i = n,
i = 1, = 1.
i
i+1
1
1
1
=
which can only be generated by for i = n + 1. But i is never
i+1
n+1
i
1
for the starting value of i and
n + 1. Therefore, everything cancels except
i
1
for the ending value of i. Therefore, we see that
i+1
Sn = 1

1
n+1

This can be veried if we expand Sn

Sn

1 1 1 1 1 1
1
1
1
1
+ + + ... +
+
1 2 2 3 3 4
n1 n n n+1
1
= 1
n+1

Since
lim Sn = 1

It follows that




1
i=1

3.2

1
i+1


=1

Case p = 2

In this case,
Sn =

n 


1
i=1

i
i+2

1
1
and
will generate the same
i
i+2
values with opposite signs for values of i which are 2 units apart. Therefore,
using the same reasoning as above, we see that the rst two values generated by
1
1
and the last two values generated by
will not cancel. Everything else
i
i+2
will cancel. Hence,
1
1
1
Sn = 1 +

2 n+1 n+2
We see that
1
lim Sn = 1 +
n
2
Therefore




1
1
1

=1+
i
i
+
2
2
i=1
This is similar to above, but this time,

3.3

General case

In this case,
Sn =

n 


1

i
i+p

i=1

1
1
and
will generate the same
i
i+p
values with opposite signs for values of i which are p units apart. Therefore,
using the same reasoning as above, we see that the rst p values generated by
1
1
and the last p values generated by
will not cancel. Everything else will
i
i+2
cancel. Hence,
This is similar to above, but this time,

Sn = 1 +

1 1
1
1
1
1
+ + ... +

...
2 3
p n+1 n+2
n+p

We see that

1 1
1
+ + ... +
2 3
p

lim Sn = 1 +

Therefore



1
i=1

1
i+p


= 1+
=

p


1
i=1

1 1
1
+ + ... +
2 3
p
i

3.4

Conclusion

The above has shown us that if p is any positive integer, then




1

i=1

Our original problem was to study

1
i+p

i=1

i=1

Since




1
i=1

1
i+p


=

p


1
i=1

(3)

1
. We saw above that
i (i + p)

1
1
=
i (i + p)
p
i=1

1
1

i
i+p


converges, we have by equation 2

i=1



1
1
1
1
=

i (i + p)
p i=1 i
i+p

Using equation 3, we obtain the following theorem

Theorem 5 If p is a positive integer, then

i=1

1
1
1
=
i (i + p)
p i=1 i

(4)

Corollary 6 If p is a positive integer, and C is a constant, then

i=1

p
C
C
1
=
i (i + p)
p i=1 i

(5)

1
i (i + 1)
i=1
This is a series like the one in equation 4 with p = 1. Therefore,
Example 7 Study the convergence of

i=1

1
i (i + 1)

1
1
1 i=1 i

= 1

You will recall that we had already derived this result as an example in the
handout on series.

1
i (i + 2)
i=1
This is a series like the one in equation 4 with p = 2. Therefore,
Example 8 Study the convergence of

i=1

1
i (i + 2)

1
1
2 i=1 i


1
1
1+
2
2
3
4

=
=
=

You will recall that we had already found this result as part as one of the exercises
assigned.

5
i
(i
+ 3)
i=1
This is a series like the one in equation 5 with p = 3 and C = 5. Therefore,
Example 9 Study the convergence of

i=1

5
i (i + 3)

5
1
3 i=1 i


5
1 1
1+ +
3
2 3
55
18

=
=
=