The running totals are 21,32,43,54, and the pattern is impossible to miss: after
n terms the sum appears to be n+1n. That is a bold guess from four data points, and guessing
is not proving. The reason it is true comes from rewriting a single term.
Look at the third term by itself, 3⋅41. It splits into a difference of two simpler
fractions,
3⋅41=31−41,
which you can check by combining the right side over a common denominator: 31−41=124−3=121=3⋅41. Every term has this same shape, k(k+1)1,
and the identical split works for any k, not just 3:
k(k+1)1=k1−k+11.
You do not have to take that on faith either. Combine the right side back over the common denominator
k(k+1) and watch it rebuild the left side exactly:
The two sides agree, so the split is an exact identity, not an approximation. Recombining like this is how
you check any split in this lesson: if the pieces add back to the original, the split is safe to use.
Now replace each term of the sum with its split and see what happens:
The −21 in the first bracket meets the +21 in the second and cancels. The −31 meets
the +31 in the bracket after it. Every fraction on the inside is subtracted once and added back
once, so it disappears. Only two pieces have no partner: the 11 at the very front and the
−n+11 at the very end:
k=1∑nk(k+1)1=1−n+11=n+1n.
That is the guessed pattern, now proved. The messy sum of n fractions is really just 1−n+11
in disguise.
Splitting each fraction into a difference lines the terms up so every interior piece is subtracted in one bracket and added back in the next. The three inside pieces cancel, and only the first term and the last term survive, so the sum folds shut to 1 minus 1/5 = 4/5.
The telescoping principle
The workhorse example used one idea, and that idea works far beyond this single sum. Each term was a
difference of two values of a simpler sequence, one step apart, and when you chain those differences
together, the insides cancel in pairs. The same cancellation still works when the values are farther
than one step apart, as you’ll see later in this lesson.
Suppose every term of a sum can be written as a difference of consecutive values of some sequence
b1,b2,b3,…, meaning ak=bk−bk+1. Write the sum out in full, one bracket per term:
Follow any value from the middle, say b2. It appears once as −b2 at the end of the first bracket and
once as +b2 at the start of the second bracket. Those two occurrences add to zero. The same holds
for b3, for b4, and for every value out to bn: each is subtracted in one bracket and added right
back in the next. The only pieces that never find a partner are the b1 at the very front and the
−bn+1 at the very end. The b1 is never subtracted, and the −bn+1 is never added back.
Everything between them cancels, so
k=1∑nak=b1−bn+1.
If the terms are instead built the other way around, ak=bk+1−bk, the same pairing leaves the
mirror image, with the last value surviving positive and the first negative:
k=1∑nak=bn+1−b1.
∎
This is where the name comes from. An old pocket telescope is a stack of tubes that slides shut into a
short ring. A telescoping sum does the same thing: a line of many terms slides shut into just a few
survivors. In general, the method is to find a sequence bk so that each term of your sum is a
shifted difference of bk‘s values, then read the answer straight off as whatever boundary values
fail to cancel; a wider gap between the shifted positions leaves more of them to keep and combine.
The simplest case, a gap of 1, needs only two steps. First, find a sequence bk so that each term of
your sum is bk−bk+1 (or bk+1−bk). Second, read the answer straight off as b1−bn+1
(or bn+1−b1), since those are the only two boundary values a gap-1 telescope leaves. For the
workhorse sum, bk=k1, so b1−bn+1=1−n+11, exactly what we found by hand.
Worked example 1A finite total and an infinite total
Use the telescoping result to find the sum of the first 6 terms of
1⋅21+2⋅31+3⋅41+⋯, and then find the value of the
whole infinite sum.
Each term is k(k+1)1=k1−k+11, and we proved the collapsed total is
1−n+11. For the first 6 terms, set n=6:
k=1∑6k(k+1)1=1−6+11=1−71=76.
For the infinite sum, look at what the finite total 1−n+11 does as n climbs. The leftover
term n+11 shrinks toward nothing, exactly the shrinking-tail idea from the geometric-series
lesson, so the running total settles right next to 1:
1⋅21+2⋅31+3⋅41+⋯=1.
Infinitely many positive fractions add up to a clean 1, because each one you add just fills a little more
of the gap n+11 that is left.
Check your understanding
Using the split k(k+1)1=k1−k+11, what is k=1∑9k(k+1)1?
The split makes the sum telescope, leaving only the first and last pieces. With n=9 the collapsed total is 1−n+11.
∑k=19k(k+1)1=1−101=109
The value 1 is the infinite sum, reached only as n grows without end, not at n=9.
When two terms survive at each end
The gap between the two factors is not always 1. Consider k(k+2)1, where the factors differ
by 2. The natural split is again a difference, but a plain k1−k+21 overshoots, so a
correcting factor is needed. Combine k1−k+21 and see why:
k1−k+21=k(k+2)(k+2)−k=k(k+2)2.
That is twice too big, so halve it. The correct split carries a factor of 21:
k(k+2)1=21(k1−k+21).
Because the gap is 2, each negative piece cancels the positive piece two brackets later, not one.
That leaves a longer tail of survivors at both ends, which is the classic trap in these problems.
Worked example 2The gap-2 telescope
Find a formula for k=1∑nk(k+2)1, and then its infinite value.
Pull the constant 21 out front and expand the difference with bk=k1, so each term is
21(bk−bk+2):
Now track the cancellation with the gap of 2. The −31 from the first bracket cancels the
+31 in the third bracket; the −41 cancels the +41 two brackets down; and so on. The
positive fractions are 11,21,31,…,n1, while the negative ones are
31,41,…,n+21. Everything from 31 through n1 cancels, leaving two
positives at the front, 11 and 21, and two negatives at the back, n+11 and
n+21:
A quick check with n=2 keeps us honest: the direct sum is
1⋅31+2⋅41=31+81=2411, and the formula gives
43−21(31+41)=43−247=2411. They match.
For the infinite sum, both leftover terms n+11 and n+21 shrink to nothing as n
grows, so only the 43 remains:
1⋅31+2⋅41+3⋅51+⋯=43.
Check your understanding
What is k=1∑∞k(k+2)1?
Two things are easy to drop here: the correcting factor 21, and the second survivor at each end.
23 forgets to halve 1+21. 21 keeps only one survivor at each end instead of two, as if the gap were still 1. 1 is the answer to the earlier gap-1 sum, not this one.
Telescoping with square roots
Telescopes are not only for fractions. Any expression that is a difference of shifted values of some
sequence will collapse the same way. Take the sum of k+1−k, which is already a
consecutive difference with bk=k built in the mirror direction bk+1−bk:
The interior square roots all cancel, and the mirror form leaves the last value positive and the first
negative, giving n+1−1=n+1−1.
You will also meet this same telescope disguised as a fraction. The term
k+k+11 looks nothing like a difference, but rationalizing the denominator (the
trick from the radicals chapter, multiply top and bottom by the conjugate k+1−k) uncovers
one:
Reading the terms out, 2k+1 runs through 3,5,7,…,2n+1, so this says
3+5+7+⋯+(2n+1)=(n+1)2−1. Add the missing 1 to both sides and you recover the
familiar fact that the first n+1 odd numbers sum to a perfect square, (n+1)2. The old “odd numbers
build squares” pattern is a telescope in disguise.
The same difference idea reaches beyond fractions: the log-quotient rule writes
log(kk+1)=log(k+1)−log(k), so ∑k=1nlog(kk+1)
collapses to log(n+1).
Does the infinite sum settle?
Every telescope in this lesson collapses down to a small, fixed number of boundary terms: two for a
gap-1 telescope like b1−bn+1, or four for the gap-2 telescope above. Either way, whether the
infinite version has a finite value depends entirely on whether the complete surviving boundary
expression, not necessarily each piece of it on its own, settles at one fixed value as n grows. Two of
our gap-1 examples show the two outcomes side by side. For k(k+1)1 the finite total is
1−n+11, and the tail n+11 shrinks toward nothing, so the surviving expression
settles at 1, and the infinite sum is that clean 1. For k+1−k the finite total is
n+1−1, and n+1 grows without bound as n climbs, so that infinite sum has no finite
value at all. Same collapse shape, opposite fate: a telescoping sum has a finite infinite value exactly
when its complete surviving boundary expression settles at one fixed value instead of running off. A
wider-gap telescope can settle even where an individual survivor does not, as long as the survivors are
combined first; what has to settle is the combination, not each piece checked on its own.
Common mistakes
Practice
Multiple Choice Questions (MCQ)
Progressively harder sets of questions. Each opens on its own page.
Practice problems at the level of the course, to be worked out on paper. Hints one at a
time, then the answer or the full worked solution, with your progress kept in this browser.
Adding infinitely many positive fractions rarely comes to a clean number. Around 1650 a lecturer in
Bologna, a university town in northern Italy, showed that this one does.
Pietro Mengoli taught mathematics there, and he served as a priest as well. He proved that
1⋅21+2⋅31+3⋅41+⋯ comes to exactly 1. The idea
behind his argument is the same cancellation you have just done. Split every fraction into a difference.
Let the middle destroy itself, and read off whatever survives at the ends.
Mengoli then asked a question that looks much the same, and it is nothing of the sort. What is the total
of 1+41+91+161+⋯, the reciprocals of the square numbers?
Nothing here splits the way our fractions did. The fraction k21 hides no difference of
consecutive terms the way k(k+1)1 did. So the telescope trick will not close, and nothing
cancels. The question stayed open for nearly a hundred years, defeating the
best minds of the day. The answer, when it finally arrived, turned on pi, of all things. Without meaning
to, Mengoli had marked out the boundary of his own method. A sum folds shut when its terms are
differences in disguise, and stalls dead when they are not.