Telescoping Sums Advanced. This lesson goes beyond core Algebra I. You can skip it.

Learning goals

  • Write terms as shifted differences so the interior cancels
  • Split 1k(k+1)\tfrac{1}{k(k+1)} into 1k−1k+1\tfrac1k - \tfrac{1}{k+1}
  • Explain why a gap of two leaves two survivors at each end
  • Telescope square roots and consecutive squares the same way
  • Decide convergence from whether the surviving tail settles

A sum that seems to have no total

Take the fractions 11⋅2+12⋅3+13⋅4+⋯\frac{1}{1\cdot 2} + \frac{1}{2\cdot 3} + \frac{1}{3\cdot 4} + \cdots and just add them one at a time, keeping a running total after each new term:

11⋅2=12,12+12⋅3=23,23+13⋅4=34,34+14⋅5=45.\frac{1}{1\cdot 2} = \frac12, \qquad \frac12 + \frac{1}{2\cdot 3} = \frac23, \qquad \frac23 + \frac{1}{3\cdot 4} = \frac34, \qquad \frac34 + \frac{1}{4\cdot 5} = \frac45.

The running totals are 12,23,34,45\frac12, \frac23, \frac34, \frac45, and the pattern is impossible to miss: after nn terms the sum appears to be nn+1\frac{n}{n+1}. 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, 13⋅4\frac{1}{3\cdot 4}. It splits into a difference of two simpler fractions,

13⋅4=13−14,\frac{1}{3\cdot 4} = \frac13 - \frac14,

which you can check by combining the right side over a common denominator: 13−14=4−312=112=13⋅4\frac13 - \frac14 = \frac{4-3}{12} = \frac{1}{12} = \frac{1}{3\cdot 4}. Every term has this same shape, 1k(k+1)\frac{1}{k(k+1)}, and the identical split works for any kk, not just 33:

1k(k+1)=1k−1k+1.\frac{1}{k(k+1)} = \frac{1}{k} - \frac{1}{k+1}.

You do not have to take that on faith either. Combine the right side back over the common denominator k(k+1)k(k+1) and watch it rebuild the left side exactly:

1k−1k+1=k+1k(k+1)−kk(k+1)=(k+1)−kk(k+1)=1k(k+1).\frac{1}{k} - \frac{1}{k+1} = \frac{k+1}{k(k+1)} - \frac{k}{k(k+1)} = \frac{(k+1) - k}{k(k+1)} = \frac{1}{k(k+1)}.

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:

∑k=1n1k(k+1)=(11−12)+(12−13)+(13−14)+⋯+(1n−1n+1).\sum_{k=1}^{n} \frac{1}{k(k+1)} = \left(\frac11 - \frac12\right) + \left(\frac12 - \frac13\right) + \left(\frac13 - \frac14\right) + \cdots + \left(\frac1n - \frac{1}{n+1}\right).

The −12-\frac12 in the first bracket meets the +12+\frac12 in the second and cancels. The −13-\frac13 meets the +13+\frac13 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\frac11 at the very front and the −1n+1-\frac{1}{n+1} at the very end:

∑k=1n1k(k+1)=1−1n+1=nn+1.\sum_{k=1}^{n} \frac{1}{k(k+1)} = 1 - \frac{1}{n+1} = \frac{n}{n+1}.

That is the guessed pattern, now proved. The messy sum of nn fractions is really just 1−1n+11 - \frac{1}{n+1} in disguise.

Telescoping cancellation for the sum of 1/(k(k+1))The expanded sum (1 - 1/2) + (1/2 - 1/3) + (1/3 - 1/4) + (1/4 - 1/5). Each interior fraction is subtracted then added back, so the matching pairs cancel, leaving 1 - 1/5 = 4/5.(1-1/2)+(1/2-1/3)+(1/3-1/4)+(1/4-1/5)1 - 1/5 = 4/5
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.

A telescoping sum collapses to b1−bn+1b_1 - b_{n+1}#

Suppose every term of a sum can be written as a difference of consecutive values of some sequence b1,b2,b3,…b_1, b_2, b_3, \ldots, meaning ak=bk−bk+1a_k = b_k - b_{k+1}. Write the sum out in full, one bracket per term:

∑k=1nak=(b1−b2)+(b2−b3)+(b3−b4)+⋯+(bn−1−bn)+(bn−bn+1).\sum_{k=1}^{n} a_k = (b_1 - b_2) + (b_2 - b_3) + (b_3 - b_4) + \cdots + (b_{n-1} - b_n) + (b_n - b_{n+1}).

Follow any value from the middle, say b2b_2. It appears once as −b2-b_2 at the end of the first bracket and once as +b2+b_2 at the start of the second bracket. Those two occurrences add to zero. The same holds for b3b_3, for b4b_4, and for every value out to bnb_n: each is subtracted in one bracket and added right back in the next. The only pieces that never find a partner are the b1b_1 at the very front and the −bn+1-b_{n+1} at the very end. The b1b_1 is never subtracted, and the −bn+1-b_{n+1} is never added back. Everything between them cancels, so

∑k=1nak=b1−bn+1.\sum_{k=1}^{n} a_k = b_1 - b_{n+1}.

If the terms are instead built the other way around, ak=bk+1−bka_k = b_{k+1} - b_k, the same pairing leaves the mirror image, with the last value surviving positive and the first negative:

∑k=1nak=bn+1−b1.\sum_{k=1}^{n} a_k = b_{n+1} - b_1.

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 bkb_k so that each term of your sum is a shifted difference of bkb_k‘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 11, needs only two steps. First, find a sequence bkb_k so that each term of your sum is bk−bk+1b_k - b_{k+1} (or bk+1−bkb_{k+1} - b_k). Second, read the answer straight off as b1−bn+1b_1 - b_{n+1} (or bn+1−b1b_{n+1} - b_1), since those are the only two boundary values a gap-11 telescope leaves. For the workhorse sum, bk=1kb_k = \frac1k, so b1−bn+1=1−1n+1b_1 - b_{n+1} = 1 - \frac{1}{n+1}, exactly what we found by hand.

Worked example 1 A finite total and an infinite total

Use the telescoping result to find the sum of the first 66 terms of 11⋅2+12⋅3+13⋅4+⋯\frac{1}{1\cdot 2} + \frac{1}{2\cdot 3} + \frac{1}{3\cdot 4} + \cdots, and then find the value of the whole infinite sum.

Each term is 1k(k+1)=1k−1k+1\frac{1}{k(k+1)} = \frac1k - \frac{1}{k+1}, and we proved the collapsed total is 1−1n+11 - \frac{1}{n+1}. For the first 66 terms, set n=6n = 6:

∑k=161k(k+1)=1−16+1=1−17=67.\sum_{k=1}^{6} \frac{1}{k(k+1)} = 1 - \frac{1}{6+1} = 1 - \frac17 = \frac67.

For the infinite sum, look at what the finite total 1−1n+11 - \frac{1}{n+1} does as nn climbs. The leftover term 1n+1\frac{1}{n+1} shrinks toward nothing, exactly the shrinking-tail idea from the geometric-series lesson, so the running total settles right next to 11:

11⋅2+12⋅3+13⋅4+⋯=1.\frac{1}{1\cdot 2} + \frac{1}{2\cdot 3} + \frac{1}{3\cdot 4} + \cdots = 1.

Infinitely many positive fractions add up to a clean 11, because each one you add just fills a little more of the gap 1n+1\frac{1}{n+1} that is left.

Check your understanding

Using the split 1k(k+1)=1k−1k+1\frac{1}{k(k+1)} = \frac1k - \frac{1}{k+1}, what is ∑k=191k(k+1)\displaystyle\sum_{k=1}^{9} \frac{1}{k(k+1)}?

Answer choices

When two terms survive at each end

The gap between the two factors is not always 11. Consider 1k(k+2)\frac{1}{k(k+2)}, where the factors differ by 22. The natural split is again a difference, but a plain 1k−1k+2\frac1k - \frac{1}{k+2} overshoots, so a correcting factor is needed. Combine 1k−1k+2\frac1k - \frac{1}{k+2} and see why:

1k−1k+2=(k+2)−kk(k+2)=2k(k+2).\frac1k - \frac{1}{k+2} = \frac{(k+2) - k}{k(k+2)} = \frac{2}{k(k+2)}.

That is twice too big, so halve it. The correct split carries a factor of 12\frac12:

1k(k+2)=12(1k−1k+2).\frac{1}{k(k+2)} = \frac12\left(\frac1k - \frac{1}{k+2}\right).

Because the gap is 22, 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 2 The gap-2 telescope

Find a formula for ∑k=1n1k(k+2)\displaystyle\sum_{k=1}^{n} \frac{1}{k(k+2)}, and then its infinite value.

Pull the constant 12\frac12 out front and expand the difference with bk=1kb_k = \frac1k, so each term is 12(bk−bk+2)\frac12(b_k - b_{k+2}):

∑k=1n1k(k+2)=12[(11−13)+(12−14)+(13−15)+(14−16)+⋯+(1n−1n+2)].\begin{aligned} \sum_{k=1}^{n} \frac{1}{k(k+2)} = \frac12\Bigl[&\left(\frac11 - \frac13\right) + \left(\frac12 - \frac14\right) + \left(\frac13 - \frac15\right) \\ &+ \left(\frac14 - \frac16\right) + \cdots + \left(\frac1n - \frac{1}{n+2}\right)\Bigr]. \end{aligned}

Now track the cancellation with the gap of 22. The −13-\frac13 from the first bracket cancels the +13+\frac13 in the third bracket; the −14-\frac14 cancels the +14+\frac14 two brackets down; and so on. The positive fractions are 11,12,13,…,1n\frac11, \frac12, \frac13, \ldots, \frac1n, while the negative ones are 13,14,…,1n+2\frac13, \frac14, \ldots, \frac{1}{n+2}. Everything from 13\frac13 through 1n\frac1n cancels, leaving two positives at the front, 11\frac11 and 12\frac12, and two negatives at the back, 1n+1\frac{1}{n+1} and 1n+2\frac{1}{n+2}:

∑k=1n1k(k+2)=12(1+12−1n+1−1n+2)=34−12(1n+1+1n+2).\sum_{k=1}^{n} \frac{1}{k(k+2)} = \frac12\left(1 + \frac12 - \frac{1}{n+1} - \frac{1}{n+2}\right) = \frac34 - \frac12\left(\frac{1}{n+1} + \frac{1}{n+2}\right).

A quick check with n=2n = 2 keeps us honest: the direct sum is 11⋅3+12⋅4=13+18=1124\frac{1}{1\cdot 3} + \frac{1}{2\cdot 4} = \frac13 + \frac18 = \frac{11}{24}, and the formula gives 34−12(13+14)=34−724=1124\frac34 - \frac12\left(\frac13 + \frac14\right) = \frac34 - \frac{7}{24} = \frac{11}{24}. They match.

For the infinite sum, both leftover terms 1n+1\frac{1}{n+1} and 1n+2\frac{1}{n+2} shrink to nothing as nn grows, so only the 34\frac34 remains:

11⋅3+12⋅4+13⋅5+⋯=34.\frac{1}{1\cdot 3} + \frac{1}{2\cdot 4} + \frac{1}{3\cdot 5} + \cdots = \frac34.

Check your understanding

What is ∑k=1∞1k(k+2)\displaystyle\sum_{k=1}^{\infty} \frac{1}{k(k+2)}?

Answer choices

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\sqrt{k+1} - \sqrt{k}, which is already a consecutive difference with bk=kb_k = \sqrt{k} built in the mirror direction bk+1−bkb_{k+1} - b_k:

∑k=1n(k+1−k)=(2−1)+(3−2)+⋯+(n+1−n)=n+1−1.\begin{aligned} \sum_{k=1}^{n} \left(\sqrt{k+1} - \sqrt{k}\right) &= \left(\sqrt2 - \sqrt1\right) + \left(\sqrt3 - \sqrt2\right) + \cdots + \left(\sqrt{n+1} - \sqrt{n}\right) \\ &= \sqrt{n+1} - 1. \end{aligned}

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\sqrt{n+1} - \sqrt{1} = \sqrt{n+1} - 1.

You will also meet this same telescope disguised as a fraction. The term 1k+k+1\frac{1}{\sqrt{k} + \sqrt{k+1}} 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\sqrt{k+1} - \sqrt{k}) uncovers one:

1k+k+1=k+1−k(k+1+k)(k+1−k)=k+1−k(k+1)−k=k+1−k.\begin{aligned} \frac{1}{\sqrt{k} + \sqrt{k+1}} &= \frac{\sqrt{k+1} - \sqrt{k}}{\left(\sqrt{k+1} + \sqrt{k}\right)\left(\sqrt{k+1} - \sqrt{k}\right)} \\ &= \frac{\sqrt{k+1} - \sqrt{k}}{(k+1) - k} = \sqrt{k+1} - \sqrt{k}. \end{aligned}

The denominator became a difference of squares, (k+1)−k=1(k+1) - k = 1, so the whole fraction is just k+1−k\sqrt{k+1} - \sqrt{k}, the very telescope above.

Worked example 3 A square-root telescope

Find ∑k=1991k+k+1\displaystyle\sum_{k=1}^{99} \frac{1}{\sqrt{k} + \sqrt{k+1}}.

Rationalizing each term turns it into a difference of square roots:

1k+k+1=k+1−k.\frac{1}{\sqrt{k} + \sqrt{k+1}} = \sqrt{k+1} - \sqrt{k}.

So the sum is a telescope with bk=kb_k = \sqrt{k} in the mirror direction, and it collapses to n+1−1\sqrt{n+1} - 1 with n=99n = 99:

∑k=1991k+k+1=100−1=10−1=9.\sum_{k=1}^{99} \frac{1}{\sqrt{k} + \sqrt{k+1}} = \sqrt{100} - \sqrt{1} = 10 - 1 = 9.

A sum of 9999 awkward radical fractions comes to a plain 99.

Differences of squares

A telescope can also be hiding inside a sum of whole numbers. The difference of two consecutive squares is

(k+1)2−k2=k2+2k+1−k2=2k+1,(k+1)^{2} - k^{2} = k^{2} + 2k + 1 - k^{2} = 2k + 1,

so the odd number 2k+12k+1 is secretly the difference bk+1−bkb_{k+1} - b_k with bk=k2b_k = k^{2}. Summing the odd numbers therefore telescopes:

∑k=1n(2k+1)=∑k=1n[(k+1)2−k2]=(n+1)2−12=(n+1)2−1.\sum_{k=1}^{n} (2k+1) = \sum_{k=1}^{n}\left[(k+1)^{2} - k^{2}\right] = (n+1)^{2} - 1^{2} = (n+1)^{2} - 1.

Reading the terms out, 2k+12k+1 runs through 3,5,7,…,2n+13, 5, 7, \ldots, 2n+1, so this says 3+5+7+⋯+(2n+1)=(n+1)2−13 + 5 + 7 + \cdots + (2n+1) = (n+1)^{2} - 1. Add the missing 11 to both sides and you recover the familiar fact that the first n+1n+1 odd numbers sum to a perfect square, (n+1)2(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⁡ ⁣(k+1k)=log⁡(k+1)−log⁡(k)\log\!\left(\frac{k+1}{k}\right) = \log(k+1) - \log(k), so ∑k=1nlog⁡ ⁣(k+1k)\sum_{k=1}^{n} \log\!\left(\frac{k+1}{k}\right) collapses to log⁡(n+1)\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+1b_1 - b_{n+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 nn grows. Two of our gap-1 examples show the two outcomes side by side. For 1k(k+1)\frac{1}{k(k+1)} the finite total is 1−1n+11 - \frac{1}{n+1}, and the tail 1n+1\frac{1}{n+1} shrinks toward nothing, so the surviving expression settles at 11, and the infinite sum is that clean 11. For k+1−k\sqrt{k+1} - \sqrt{k} the finite total is n+1−1\sqrt{n+1} - 1, and n+1\sqrt{n+1} grows without bound as nn 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.

Core practice

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.

Core practice Work it out on paper 10 problems Start →
More practice (optional)

Extra sets, as hard as the Challenge set. Each one opens on its own page.

More resources (optional)

Other explanations of this lesson, if you want a second take.

A bit of history (optional)

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 11⋅2+12⋅3+13⋅4+⋯\frac{1}{1\cdot 2} + \frac{1}{2\cdot 3} + \frac{1}{3\cdot 4} + \cdots comes to exactly 11. 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+14+19+116+⋯1 + \frac14 + \frac19 + \frac{1}{16} + \cdots, the reciprocals of the square numbers?

Nothing here splits the way our fractions did. The fraction 1k2\frac{1}{k^2} hides no difference of consecutive terms the way 1k(k+1)\frac{1}{k(k+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.