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:
- Decompose the general term into a difference (for sums) or ratio (for products).
- Write out several terms to confirm the cancellation pattern.
- Collapse down to boundary terms.
- Evaluate what remains.
Telescoping Sums
The Fundamental Idea
If you compute , writing it out gives
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 , we solve , giving , :
So .
Wider Gaps
When factors are not consecutive, cancellation still occurs but with a gap. For , writing out terms:
Each positive cancels with the negative appearing two terms later. The first 2 and last 2 terms survive:
General principle: a decomposition with gap leaves boundary terms at each end.
Quadratic Denominators
Since , we get gap 2:
So , which converges to as .
Rationalizing Radicals
For , multiply by the conjugate:
Then .
Double Telescoping (Cubic Denominators)
For , partial fractions give
Defining , each term is , which telescopes to
Telescoping Products
The multiplicative analogue: , since each numerator cancels with the adjacent denominator.
Example. .
Example. For , factor as and split into two products:
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 and track boundary terms at each end.
- For products, rewrite each factor as .
- For infinite sums, verify the tail terms vanish.
Common Pitfalls
- Forgetting boundary terms. With gap , you must keep terms at each end. Losing one is the most common error.
- Expanding before factoring. Multiplying out just to re-factor it wastes effort and invites mistakes.
- Mismatched indices. Verify that from term actually cancels with from the correct neighboring term.
- Ignoring convergence. For infinite series, confirm .
Practice Problems
Problem: 2025 AMC 10B Problem 15
The sum can be expressed as , where and are relatively prime positive integers. What is ?
Solution
Factor the denominator. .
Partial fractions. Setting and solving (plug in ) gives , , :
Regroup for telescoping. Write as
where . This is a gap-2 telescope in .
Collapse. since .
Final answer. , and , so . The answer is .
| Status | Source | Problem Name | Difficulty | Tags | ||
|---|---|---|---|---|---|---|
| Berkeley Math Circle | Hard | Show TagsSums and products, Telescoping series | ||||
| Berkeley Math Circle Take-Home Contest #6 | Hard | Show TagsInduction / smoothing, Polynomial operations, Sums and products, Telescoping series | ||||
| Berkeley Math Circle Monthly Contest 4 | Hard | Show TagsSums and products, Telescoping series | ||||
| MathNet | Hard | Show TagsSums and products, Telescoping series | ||||
| Berkeley Math Circle Monthly Contest 5 | Hard | Show TagsRecurrence relations, Telescoping series | ||||
| MathNet | Hard | Show TagsSums and products, Telescoping series | ||||
| Berkeley Math Circle | Hard | Show TagsChebyshev polynomials, Recurrence relations, Telescoping series | ||||
| Harvard-MIT Math Tournament | Hard | Show TagsPolynomial operations, Sums and products, Telescoping series | ||||
| USA IMO | Hard | Show TagsGenerating functions, Sums and products, Telescoping series | ||||
| Harvard-MIT Math Tournament | Hard | Show TagsTelescoping series | ||||
| Harvard-MIT Math Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsCounting two ways, Floors and ceilings, Telescoping series, σ (sum of divisors) | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial operations, Sums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial operations, Sums and products, Telescoping series | ||||
| 10th Annual Harvard-MIT Mathematics Tournament | Hard | Show TagsFactorization techniques, Sums and products, Telescoping series, σ (sum of divisors), φ (Euler's totient) | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsPolynomial operations, Telescoping series | ||||
| Harvard-MIT November Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Bay Area Mathematical Olympiad | Hard | Show TagsInduction / smoothing, Recurrence relations, Sums and products, Telescoping series | ||||
| Harvard-MIT November Tournament | Hard | Show TagsRecurrence relations, Sums and products, Telescoping series | ||||
| Harvard-MIT November Tournament | Hard | Show TagsAlgebraic properties of binomial coefficients, Telescoping series | ||||
| 13th Annual Harvard-MIT Mathematics Tournament | Hard | Show TagsTelescoping series | ||||
| USAMO 2010 | Hard | Show TagsGreatest common divisors (gcd), Prime numbers, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsSums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsRecurrence relations, Sums and products, Telescoping series | ||||
| Harvard-MIT Mathematics Tournament | Hard | Show TagsGreatest common divisors (gcd), Pick's theorem, Telescoping series, φ (Euler's totient) | ||||
| HMMT November | Hard | Show TagsRecurrence relations, Telescoping series | ||||
| HMMT November 2014 | Hard | Show TagsLogarithmic functions, Telescoping series | ||||
| USAMO | Hard | Show TagsCounting two ways, Greatest common divisors (gcd), Telescoping series | ||||
| HMMT February 2015 | Hard | Show TagsRecurrence relations, Telescoping series | ||||
| HMMT February | Hard | Show TagsComplex numbers, Telescoping series | ||||
| HMMT November 2015 | Hard | Show TagsFractions, Greatest common divisors (gcd), Inverses mod n, Sums and products, Telescoping series | ||||
| HMMT November | Hard | Show TagsSums and products, Telescoping series | ||||
| HMMT February 2016 | Hard | Show TagsRecurrence relations, Telescoping series | ||||
| HMMT November | Hard | Show TagsPolynomial operations, Sums and products, Telescoping series | ||||
| HMMT November 2018 | Hard | Show TagsRecurrence relations, Telescoping series | ||||
| HMMT February | Hard | Show TagsTelescoping series | ||||
| USA TSTST | Hard | Show TagsFactorization techniques, Polynomials, Quadratic forms, Techniques: modulo, size analysis, order analysis, inequalities, Telescoping series | ||||
| HMMT February 2019 | Hard | Show TagsFloors and ceilings, Infinite descent / root flipping, Recurrence relations, Telescoping series, Vieta's formulas | ||||
| HMMT February 2020 | Hard | Show TagsInduction / smoothing, Recurrence relations, Sums and products, Telescoping series | ||||
| HMMT February 2020 | Hard | Show TagsPolynomial operations, Sums and products, Telescoping series | ||||
| HMMO 2020 | Hard | Show TagsSums and products, Telescoping series, τ (number of divisors) | ||||
| HMMT Spring 2021 Guts Round | Hard | Show TagsSums and products, Telescoping series | ||||
| HMMT November 2021 | Hard | Show TagsTelescoping series | ||||
| USA Junior MO | Hard | Show TagsCauchy-Schwarz, Telescoping series | ||||
| HMMT February | Hard | Show TagsTelescoping series | ||||
| USA TSTST | Hard | Show TagsCauchy-Schwarz, Induction / smoothing, Sums and products, Telescoping series | ||||
| HMMT November 2024 | Hard | Show TagsSums and products, Telescoping series | ||||
| AMC 12 A | Hard | Show TagsRecurrence relations, Sums and products, Telescoping series | ||||
| HMMT February 2024 Guts Round | Hard | Show TagsPolynomial operations, Sums and products, Telescoping series | ||||
| HMMT February | Hard | Show TagsDivisibility / Factorization, Floors and ceilings, Recurrence relations, Telescoping series | ||||
| AIME II | Hard | 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.
