PrevNext

Overview

Many competition problems ask you to evaluate a sum or product whose closed form is not immediately obvious. A powerful strategy is telescoping: rewriting each term so that most of it cancels with a neighboring term, leaving only a handful of boundary terms.

The name comes from a collapsible spyglass — you start with something long and it collapses down to something short. The workflow is always:

  1. Decompose the general term into a difference (for sums) or ratio (for products).
  2. Write out several terms to confirm the cancellation pattern.
  3. Collapse down to boundary terms.
  4. Evaluate what remains.

Telescoping Sums

The Fundamental Idea

If you compute ∑k=1n(ak−ak+1)\sum_{k=1}^{n}(a_k - a_{k+1}), writing it out gives

(a1−a2)+(a2−a3)+⋯+(an−an+1)=a1−an+1.(a_1 - a_2) + (a_2 - a_3) + \cdots + (a_n - a_{n+1}) = a_1 - a_{n+1}.

Every intermediate term cancels. The challenge is finding the decomposition that turns your expression into this form.

Partial Fractions

The most common tool is partial fraction decomposition. For 1k(k+1)\frac{1}{k(k+1)}, we solve 1k(k+1)=Ak+Bk+1\frac{1}{k(k+1)} = \frac{A}{k}+\frac{B}{k+1}, giving A=1A=1, B=−1B=-1:

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

So ∑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}.

Wider Gaps

When factors are not consecutive, cancellation still occurs but with a gap. For 1k(k+2)=12(1k−1k+2)\frac{1}{k(k+2)} = \frac{1}{2}\left(\frac{1}{k}-\frac{1}{k+2}\right), writing out terms:

12[(11−13)+(12−14)+(13−15)+⋯ ].\frac{1}{2}\left[\left(\frac{1}{1}-\frac{1}{3}\right)+\left(\frac{1}{2}-\frac{1}{4}\right)+\left(\frac{1}{3}-\frac{1}{5}\right)+\cdots\right].

Each positive 1m\frac{1}{m} cancels with the negative 1m\frac{1}{m} appearing two terms later. The first 2 and last 2 terms survive:

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

General principle: a decomposition with gap dd leaves dd boundary terms at each end.

Quadratic Denominators

Since k2−1=(k−1)(k+1)k^2-1=(k-1)(k+1), we get gap 2:

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

So ∑k=2n1k2−1=12(1+12−1n−1n+1)\sum_{k=2}^{n}\frac{1}{k^2-1} = \frac{1}{2}\left(1+\frac{1}{2}-\frac{1}{n}-\frac{1}{n+1}\right), which converges to 34\frac{3}{4} as n→∞n\to\infty.

Rationalizing Radicals

For 1k+k+1\frac{1}{\sqrt{k}+\sqrt{k+1}}, multiply by the conjugate:

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

Then ∑k=1n1k+k+1=n+1−1\sum_{k=1}^{n}\frac{1}{\sqrt{k}+\sqrt{k+1}} = \sqrt{n+1}-1.

Double Telescoping (Cubic Denominators)

For 1k(k+1)(k+2)\frac{1}{k(k+1)(k+2)}, partial fractions give

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

Defining f(k)=1k−1k+1f(k)=\frac{1}{k}-\frac{1}{k+1}, each term is 12(f(k)−f(k+1))\frac{1}{2}(f(k)-f(k+1)), which telescopes to

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

Telescoping Products

The multiplicative analogue: ∏k=1nak+1ak=an+1a1\prod_{k=1}^{n}\frac{a_{k+1}}{a_k} = \frac{a_{n+1}}{a_1}, since each numerator cancels with the adjacent denominator.

Example. ∏k=2nk−1k=12⋅23⋯n−1n=1n\prod_{k=2}^{n}\frac{k-1}{k} = \frac{1}{2}\cdot\frac{2}{3}\cdots\frac{n-1}{n} = \frac{1}{n}.

Example. For ∏k=2nk2−1k2\prod_{k=2}^{n}\frac{k^2-1}{k^2}, factor as (k−1)(k+1)k⋅k\frac{(k-1)(k+1)}{k\cdot k} and split into two products:

∏k=2nk−1k⋅∏k=2nk+1k=1n⋅n+12=n+12n.\prod_{k=2}^{n}\frac{k-1}{k}\cdot\prod_{k=2}^{n}\frac{k+1}{k} = \frac{1}{n}\cdot\frac{n+1}{2} = \frac{n+1}{2n}.

Strategy Checklist

  • Factor the denominator and look for consecutive integer factors.
  • Apply partial fractions to express each term as a difference.
  • Write out 4–5 terms explicitly — do not skip this.
  • Identify the gap dd and track dd boundary terms at each end.
  • For products, rewrite each factor as ak+1ak\frac{a_{k+1}}{a_k}.
  • For infinite sums, verify the tail terms vanish.

Common Pitfalls

  • Forgetting boundary terms. With gap dd, you must keep dd terms at each end. Losing one is the most common error.
  • Expanding before factoring. Multiplying out (k−1)(k+1)=k2−1(k-1)(k+1)=k^2-1 just to re-factor it wastes effort and invites mistakes.
  • Mismatched indices. Verify that 1k+1\frac{1}{k+1} from term kk actually cancels with 1k+1\frac{1}{k+1} from the correct neighboring term.
  • Ignoring convergence. For infinite series, confirm an→0a_n\to 0.

Practice Problems

Problem: 2025 AMC 10B Problem 15

The sum ∑k=1∞1k3+6k2+8k\displaystyle\sum_{k=1}^{\infty}\frac{1}{k^3+6k^2+8k} can be expressed as ab\frac{a}{b}, where aa and bb are relatively prime positive integers. What is a+ba+b?

(A) 89(B) 97(C) 102(D) 107(E) 129\textbf{(A)}\ 89\qquad\textbf{(B)}\ 97\qquad\textbf{(C)}\ 102\qquad\textbf{(D)}\ 107\qquad\textbf{(E)}\ 129

Solution

Factor the denominator. k3+6k2+8k=k(k+2)(k+4)k^3+6k^2+8k = k(k+2)(k+4).

Partial fractions. Setting 1k(k+2)(k+4)=Ak+Bk+2+Ck+4\frac{1}{k(k+2)(k+4)}=\frac{A}{k}+\frac{B}{k+2}+\frac{C}{k+4} and solving (plug in k=0,−2,−4k=0,-2,-4) gives A=18A=\frac{1}{8}, B=−14B=-\frac{1}{4}, C=18C=\frac{1}{8}:

1k(k+2)(k+4)=18(1k−2k+2+1k+4).\frac{1}{k(k+2)(k+4)} = \frac{1}{8}\left(\frac{1}{k}-\frac{2}{k+2}+\frac{1}{k+4}\right).

Regroup for telescoping. Write 1k−2k+2+1k+4\frac{1}{k}-\frac{2}{k+2}+\frac{1}{k+4} as

(1k−1k+2)−(1k+2−1k+4)=f(k)−f(k+2),\left(\frac{1}{k}-\frac{1}{k+2}\right)-\left(\frac{1}{k+2}-\frac{1}{k+4}\right) = f(k)-f(k+2),

where f(k)=1k−1k+2f(k)=\frac{1}{k}-\frac{1}{k+2}. This is a gap-2 telescope in ff.

Collapse. ∑k=1∞(f(k)−f(k+2))=f(1)+f(2)\sum_{k=1}^{\infty}(f(k)-f(k+2)) = f(1)+f(2) since f(k)→0f(k)\to 0.

f(1)+f(2)=(1−13)+(12−14)=23+14=1112.f(1)+f(2) = \left(1-\frac{1}{3}\right)+\left(\frac{1}{2}-\frac{1}{4}\right) = \frac{2}{3}+\frac{1}{4} = \frac{11}{12}.

Final answer. 18⋅1112=1196\frac{1}{8}\cdot\frac{11}{12} = \frac{11}{96}, and gcd⁡(11,96)=1\gcd(11,96)=1, so a+b=11+96=107a+b = 11+96 = \boxed{107}. The answer is (D)\textbf{(D)}.

StatusSourceProblem NameDifficultyTags
Berkeley Math CircleHard
Show TagsSums and products, Telescoping series
Berkeley Math Circle Take-Home Contest #6Hard
Show TagsInduction / smoothing, Polynomial operations, Sums and products, Telescoping series
Berkeley Math Circle Monthly Contest 4Hard
Show TagsSums and products, Telescoping series
MathNetHard
Show TagsSums and products, Telescoping series
Berkeley Math Circle Monthly Contest 5Hard
Show TagsRecurrence relations, Telescoping series
MathNetHard
Show TagsSums and products, Telescoping series
Berkeley Math CircleHard
Show TagsChebyshev polynomials, Recurrence relations, Telescoping series
Harvard-MIT Math TournamentHard
Show TagsPolynomial operations, Sums and products, Telescoping series
USA IMOHard
Show TagsGenerating functions, Sums and products, Telescoping series
Harvard-MIT Math TournamentHard
Show TagsTelescoping series
Harvard-MIT Math TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsCounting two ways, Floors and ceilings, Telescoping series, σ (sum of divisors)
Harvard-MIT Mathematics TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsPolynomial operations, Sums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsPolynomial operations, Sums and products, Telescoping series
10th Annual Harvard-MIT Mathematics TournamentHard
Show TagsFactorization techniques, Sums and products, Telescoping series, σ (sum of divisors), φ (Euler's totient)
Harvard-MIT Mathematics TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsPolynomial operations, Telescoping series
Harvard-MIT November TournamentHard
Show TagsSums and products, Telescoping series
Bay Area Mathematical OlympiadHard
Show TagsInduction / smoothing, Recurrence relations, Sums and products, Telescoping series
Harvard-MIT November TournamentHard
Show TagsRecurrence relations, Sums and products, Telescoping series
Harvard-MIT November TournamentHard
Show TagsAlgebraic properties of binomial coefficients, Telescoping series
13th Annual Harvard-MIT Mathematics TournamentHard
Show TagsTelescoping series
USAMO 2010Hard
Show TagsGreatest common divisors (gcd), Prime numbers, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsSums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsRecurrence relations, Sums and products, Telescoping series
Harvard-MIT Mathematics TournamentHard
Show TagsGreatest common divisors (gcd), Pick's theorem, Telescoping series, φ (Euler's totient)
HMMT NovemberHard
Show TagsRecurrence relations, Telescoping series
HMMT November 2014Hard
Show TagsLogarithmic functions, Telescoping series
USAMOHard
Show TagsCounting two ways, Greatest common divisors (gcd), Telescoping series
HMMT February 2015Hard
Show TagsRecurrence relations, Telescoping series
HMMT FebruaryHard
Show TagsComplex numbers, Telescoping series
HMMT November 2015Hard
Show TagsFractions, Greatest common divisors (gcd), Inverses mod n, Sums and products, Telescoping series
HMMT NovemberHard
Show TagsSums and products, Telescoping series
HMMT February 2016Hard
Show TagsRecurrence relations, Telescoping series
HMMT NovemberHard
Show TagsPolynomial operations, Sums and products, Telescoping series
HMMT November 2018Hard
Show TagsRecurrence relations, Telescoping series
HMMT FebruaryHard
Show TagsTelescoping series
USA TSTSTHard
Show TagsFactorization techniques, Polynomials, Quadratic forms, Techniques: modulo, size analysis, order analysis, inequalities, Telescoping series
HMMT February 2019Hard
Show TagsFloors and ceilings, Infinite descent / root flipping, Recurrence relations, Telescoping series, Vieta's formulas
HMMT February 2020Hard
Show TagsInduction / smoothing, Recurrence relations, Sums and products, Telescoping series
HMMT February 2020Hard
Show TagsPolynomial operations, Sums and products, Telescoping series
HMMO 2020Hard
Show TagsSums and products, Telescoping series, τ (number of divisors)
HMMT Spring 2021 Guts RoundHard
Show TagsSums and products, Telescoping series
HMMT November 2021Hard
Show TagsTelescoping series
USA Junior MOHard
Show TagsCauchy-Schwarz, Telescoping series
HMMT FebruaryHard
Show TagsTelescoping series
USA TSTSTHard
Show TagsCauchy-Schwarz, Induction / smoothing, Sums and products, Telescoping series
HMMT November 2024Hard
Show TagsSums and products, Telescoping series
AMC 12 AHard
Show TagsRecurrence relations, Sums and products, Telescoping series
HMMT February 2024 Guts RoundHard
Show TagsPolynomial operations, Sums and products, Telescoping series
HMMT FebruaryHard
Show TagsDivisibility / Factorization, Floors and ceilings, Recurrence relations, Telescoping series
AIME IIHard
Show TagsLogarithmic functions, Sums and products, Telescoping series

Module Progress:

Join the Discord Community!

Stuck on a problem, or don't understand a module? Join the Discord and get help with your doubts while making more math friends.

PrevNext