Skip to main content
STREAK 0dLV 1 0 XP
Institute site
AMC 8

Telescoping Basics

40 minutes of active learning · Difficulty 4/10 · Lesson

A telescoping sum is a sum whose terms cancel out almost entirely once each term is written as a difference of two simpler pieces, leaving only a first piece and a last piece behind — the way a collapsible telescope shrinks down to just its two end sections. This lesson builds the core mechanism: writing a term as a difference, and tracking exactly which pieces survive the cancellation.

What you will learn

  • Recognize a sum or product that collapses through cancellation
  • Rewrite a general term as a difference of two simpler terms
  • Explain why only the first and last terms survive

Keep paper and a pencil nearby. Try each problem before opening a hint, and mark sections reviewed as you work through them.

What telescoping means

A sum telescopes when every term can be written as a difference ak+1−aka_{k+1}-a_k for some sequence of values a1,a2,a3,…a_1,a_2,a_3,\ldots. Adding up such terms from k=1k=1 to k=nk=n produces (a2−a1)+(a3−a2)+(a4−a3)+⋯+(an+1−an)(a_2-a_1)+(a_3-a_2)+(a_4-a_3)+\cdots+(a_{n+1}-a_n), and every middle value appears twice with opposite signs — once as a positive piece in one term, and once as a negative piece in the next term — so it cancels out completely.

What remains after every cancellation is just an+1−a1a_{n+1}-a_1: the very last positive piece and the very first negative piece, with nothing in between. In general, ∑k=1n(ak+1−ak)=an+1−a1\sum_{k=1}^{n}(a_{k+1}-a_k)=a_{n+1}-a_1, no matter how large nn is or how complicated the individual values aka_k are.

Rewriting a term as a difference

The real skill in telescoping is not adding an already-differenced sum, but recognizing that an ordinary-looking term secretly equals a difference of two simpler values. The kkth odd number, 2k−12k-1, is exactly the difference of consecutive squares: k2−(k−1)2=2k−1k^2-(k-1)^2=2k-1. This means the sum of the first nn odd numbers telescopes: ∑k=1n(2k−1)=∑k=1n(k2−(k−1)2)=n2−02=n2\sum_{k=1}^{n}(2k-1)=\sum_{k=1}^{n}\big(k^2-(k-1)^2\big)=n^2-0^2=n^2, instantly explaining the classic fact that the first nn odd numbers sum to n2n^2.

Finding the right rewriting is a matter of pattern-matching: look for a family of values (squares, triangular numbers, products of consecutive integers) whose consecutive differences match the term being summed, then rewrite every term in the sum using that family.

Confirming exactly what survives

Even after spotting a telescoping pattern, it pays to write out the first two or three terms and the last one or two terms explicitly, rather than trusting the general formula blindly — this catches off-by-one errors in exactly which piece is the "first" and which is the "last." For a sum running from k=1k=1 to k=nk=n, writing out (a2−a1)+(a3−a2)+⋯+(an+1−an)(a_2-a_1)+(a_3-a_2)+\cdots+(a_{n+1}-a_n) makes it visually clear that a2a_2 through ana_n each appear once positively and once negatively, while only a1a_1 (negative) and an+1a_{n+1} (positive) never get cancelled.

This check matters most when the sum's starting or ending index is unusual — for instance, a sum that starts at k=0k=0 or ends at k=n−1k=n-1 shifts which specific values survive, and assuming the "obvious" first and last terms without checking is a common source of errors.

See the reasoning unfold

Pause after each step and predict what comes next.

Worked example 1

A direct telescoping sum

Evaluate (2−1)+(3−2)+(4−3)+(5−4)+(6−5)(2-1)+(3-2)+(4-3)+(5-4)+(6-5).

  1. Each term has the form (next value) minus (current value), so the sum telescopes.

1 of 3 steps revealed

Worked example 2

Summing odd numbers via squares

Find 1+3+5+7+9+111+3+5+7+9+11 (the first six odd numbers) by rewriting each term as a difference of consecutive squares.

  1. The kkth odd number is 2k−12k-1, which equals k2−(k−1)2k^2-(k-1)^2.

1 of 3 steps revealed

Worked example 3

Confirming which pieces survive

Evaluate (f(1)−f(0))+(f(2)−f(1))+(f(3)−f(2))+⋯+(f(10)−f(9))\big(f(1)-f(0)\big)+\big(f(2)-f(1)\big)+\big(f(3)-f(2)\big)+\cdots+\big(f(10)-f(9)\big), given that f(0)=3f(0)=3 and f(10)=57f(10)=57.

  1. This sum has the telescoping form ∑k=110(f(k)−f(k−1))\sum_{k=1}^{10}\big(f(k)-f(k-1)\big).

1 of 3 steps revealed

Common mistakes to catch

  • Adding a telescoping sum term by term instead of recognizing that nearly everything cancels.
  • Misidentifying which value is the true "first" or "last" surviving piece when the sum's index range does not start at the obvious place.
  • Failing to notice that a term like 2k−12k-1 can be rewritten as a difference of squares, and instead trying to sum it directly.

Try with support

Guided practice

Choose a strategy, take a first step, and use the hints when you need direction.

Guided problem 1

Difficulty 2/10

Evaluate (4−2)+(6−4)+(8−6)+(10−8)(4-2)+(6-4)+(8-6)+(10-8).

For example: 12, 0.75, or 3/4.

Guided problem 2

Difficulty 3/10

Find 1+3+5+71+3+5+7 (the first four odd numbers) by rewriting each term as a difference of consecutive squares and cancelling.

For example: 12, 0.75, or 3/4.

Put it into practice

Independent practice

Work on your own first. If you reveal a solution, work through it and mark it reviewed.

Independent problem 1

Difficulty 3/10

Evaluate (g(1)−g(0))+(g(2)−g(1))+(g(3)−g(2))+(g(4)−g(3))+(g(5)−g(4))\big(g(1)-g(0)\big)+\big(g(2)-g(1)\big)+\big(g(3)-g(2)\big)+\big(g(4)-g(3)\big)+\big(g(5)-g(4)\big), given that g(0)=7g(0)=7 and g(5)=42g(5)=42.

For example: 12, 0.75, or 3/4.

Independent problem 2

Difficulty 4/10

Find 1+3+5+7+9+11+131+3+5+7+9+11+13 (the first seven odd numbers) using the difference-of-squares telescoping method.

For example: 12, 0.75, or 3/4.

Independent problem 3

Difficulty 3/10

In a telescoping sum ∑k=1n(ak+1−ak)\sum_{k=1}^{n}(a_{k+1}-a_k), which terms remain after all cancellation?

Answer choices for problem 3

Independent problem 4

Difficulty 5/10

Find 2+4+6+8+10+122+4+6+8+10+12 (the first six positive even numbers) by rewriting the kkth term 2k2k as k(k+1)−(k−1)kk(k+1)-(k-1)k and cancelling.

For example: 12, 0.75, or 3/4.

Bring it together

  • A telescoping sum ∑k=1n(ak+1−ak)\sum_{k=1}^{n}(a_{k+1}-a_k) always collapses to an+1−a1a_{n+1}-a_1, since every middle value cancels.
  • Recognizing a term as a difference of a recognizable family, like 2k−1=k2−(k−1)22k-1=k^2-(k-1)^2, is the key step that reveals a telescoping pattern.
  • Write out the first few and last few terms explicitly to confirm exactly which two pieces survive, especially for unusual index ranges.

Finish with understanding.

Review each section and example, then solve each problem or work through its solution.

  • 0 / 6 sections reviewed
  • 0 / 3 worked examples explored
  • 0 / 6 problems solved or reviewed

Loading your saved progress…

Your answers, revealed steps, and lesson progress are saved in this browser.