Tutorials › Calculus II › Reciprocal Products That Telescope

Series and Partial Sums · Tutorial 566 of 998

Reciprocal Products That Telescope

Rewrite reciprocal products as scaled differences, then track the uncancelled terms to evaluate finite sums and their infinite limits.

Beginner 9 min read

What You'll Learn

  • Decompose one over n times n plus k into a difference of reciprocals.
  • Identify the terms that cancel in a finite partial sum.
  • Express the partial sum using harmonic numbers and a finite remainder.
  • Evaluate the infinite series by taking the limit of its partial sums.
  • Check coefficients and index ranges to avoid common telescoping errors.

Why reciprocal products telescope

A product in a denominator can hide a difference that is much easier to sum. For example, the terms \(1/[n(n+1)]\) do not look like a familiar sequence of cancellations. But each term can be rewritten using two reciprocals. When those rewritten terms are added, most of them cancel, leaving only a few terms at the beginning and end.

This matters for both finite sums and infinite series. A finite sum can often be evaluated exactly by tracking the terms that remain. An infinite series can then be evaluated by asking what happens to its partial sums as the number of terms grows.

Definition: For positive integers \(n\) and \(k\), a reciprocal product of the form \(1/[n(n+k)]\) can be written as a scaled difference of reciprocals. The positive integer \(k\) determines how far apart the two reciprocal terms are.

The basic decomposition

To find the decomposition, compare the two reciprocals \(1/n\) and \(1/(n+k)\). Their difference has denominator \(n(n+k)\):

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

Dividing this identity by \(k\) gives the form that matches the original term.

Key identity: For positive integers \(n\) and \(k\), the reciprocal product decomposes as follows.
$$ \frac{1}{n(n+k)} = \frac{1}{k}\left(\frac{1}{n}-\frac{1}{n+k}\right). $$

The factor \(1/k\) is essential: without it, the difference of reciprocals is \(k\) times the desired term. The simplest case is \(k=1\), which gives the especially direct identity \(1/[n(n+1)]=1/n-1/(n+1)\).

Worked Example: Decomposing \(1/[n(n+1)]\)

Use the identity with \(k=1\). The difference of the reciprocals is

$$ \frac{1}{n}-\frac{1}{n+1} = \frac{(n+1)-n}{n(n+1)} = \frac{1}{n(n+1)}. $$

Thus the required decomposition is

$$ \frac{1}{n(n+1)} = \frac{1}{n}-\frac{1}{n+1}. $$

For a numerical check, set \(n=3\). The original term is \(1/(3\cdot4)=1/12\), while the difference is \(1/3-1/4=4/12-3/12=1/12\). The two expressions agree.

Finite partial sums and cancellation

Once the terms have been decomposed, add them in order. A reciprocal with a minus sign in one term appears with a plus sign in the next term when \(k=1\). For larger \(k\), the same cancellation occurs after a gap: the negative term \(-1/(n+k)\) cancels a positive reciprocal from the term whose index is \(n+k\), provided that index is included in the sum.

It is useful to define the \(m\)th harmonic number by \(H_m=\sum_{j=1}^{m}1/j\) for each positive integer \(m\). This notation lets us record the finite sum compactly. It does not assume that an infinite harmonic series converges; here it is only a name for a finite sum.

Finite-sum formula: For positive integers \(N\) and \(k\), the first \(N\) terms satisfy the identity below.
$$ \sum_{n=1}^{N}\frac{1}{n(n+k)} = \frac{1}{k}\left(H_N+H_k-H_{N+k}\right). $$

To see the terms behind the formula, the positive reciprocals contribute \(1+1/2+\cdots+1/N=H_N\). The negative reciprocals contribute \(1/(k+1)+1/(k+2)+\cdots+1/(N+k)\), which equals \(H_{N+k}-H_k\). Subtracting the latter from the former gives \(H_N-(H_{N+k}-H_k)\), and the decomposition supplies the overall factor \(1/k\).

Worked Example: A four-term sum with \(k=2\)

Evaluate \(\sum_{n=1}^{4}1/[n(n+2)]\). First apply the decomposition with \(k=2\):

$$ \frac{1}{n(n+2)} = \frac{1}{2}\left(\frac{1}{n}-\frac{1}{n+2}\right). $$

Substitute \(n=1,2,3,4\) and add the terms:

$$ \begin{aligned} \sum_{n=1}^{4}\frac{1}{n(n+2)} &=\frac{1}{2}\left[ \left(1-\frac{1}{3}\right) +\left(\frac{1}{2}-\frac{1}{4}\right) +\left(\frac{1}{3}-\frac{1}{5}\right) +\left(\frac{1}{4}-\frac{1}{6}\right) \right]\\ &=\frac{1}{2}\left(1+\frac{1}{2}-\frac{1}{5}-\frac{1}{6}\right)\\ &=\frac{1}{2}\left(\frac{30}{30}+\frac{15}{30}-\frac{6}{30}-\frac{5}{30}\right)\\ &=\frac{1}{2}\cdot\frac{34}{30} =\frac{17}{30}. \end{aligned} $$

As a check, the four original terms are \(1/3,1/8,1/15,1/24\). With common denominator \(120\), their sum is \(40/120+15/120+8/120+5/120=68/120=17/30\), as obtained by cancellation.

Why the finite-sum formula works

The harmonic-number expression describes the same cancellation without requiring the terms to be written out individually. The following derivation also shows precisely which terms remain.

1
Apply the identity term by term.
For every \(n\) from \(1\) through \(N\), replace \(1/[n(n+k)]\) with \((1/k)(1/n-1/(n+k))\).
2
Write both finite ranges.
The positive reciprocals have indices \(1\) through \(N\); the negative reciprocals have indices \(k+1\) through \(N+k\).
3
Subtract the ranges.
The second range is \(H_{N+k}-H_k\). Subtracting it from \(H_N\), then multiplying by \(1/k\), gives the finite-sum formula.

In equations, the complete argument is

$$ \begin{aligned} \sum_{n=1}^{N}\frac{1}{n(n+k)} &=\frac{1}{k}\sum_{n=1}^{N} \left(\frac{1}{n}-\frac{1}{n+k}\right)\\ &=\frac{1}{k}\left[ \left(\sum_{n=1}^{N}\frac{1}{n}\right) - \left(\sum_{n=1}^{N}\frac{1}{n+k}\right) \right]\\ &=\frac{1}{k}\left[H_N-(H_{N+k}-H_k)\right]\\ &=\frac{1}{k}(H_N+H_k-H_{N+k}). \end{aligned} $$

This derivation is valid for every positive \(N\) and \(k\). If \(N\) is at least \(k\), the cancellation can also be seen directly: the terms with indices \(k+1\) through \(N\) cancel, leaving the first \(k\) positive reciprocals and the final \(k\) negative reciprocals. The harmonic-number formula handles the index ranges correctly even when \(N<k\).

From partial sums to the infinite series

An infinite series is defined through the limit of its partial sums. In this case, the finite-sum formula makes that limit accessible. For fixed positive integer \(k\), rewrite the formula as

$$ \sum_{n=1}^{N}\frac{1}{n(n+k)} = \frac{1}{k}\left(H_k-\sum_{j=N+1}^{N+k}\frac{1}{j}\right). $$

There are exactly \(k\) terms in the remaining finite sum. Each is positive and at most \(1/(N+1)\), so

$$ 0 < \sum_{j=N+1}^{N+k}\frac{1}{j} \leq \frac{k}{N+1}. $$

Since \(k\) is fixed, \(k/(N+1)\) tends to zero as \(N\) tends to infinity. Therefore the remaining sum tends to zero, and the partial sums tend to \(H_k/k\). By the definition of an infinite series as the limit of its partial sums, the series converges to that value.

Theorem: For every positive integer \(k\), the series of reciprocal products below converges, and its sum is \(H_k/k\).
$$ \sum_{n=1}^{\infty}\frac{1}{n(n+k)} = \frac{H_k}{k} = \frac{1}{k}\sum_{j=1}^{k}\frac{1}{j}. $$

Worked Example: The infinite series with \(k=3\)

Find the sum of \(\sum_{n=1}^{\infty}1/[n(n+3)]\), and check the first two terms of its partial sums. The decomposition is

$$ \frac{1}{n(n+3)} = \frac{1}{3}\left(\frac{1}{n}-\frac{1}{n+3}\right). $$

For \(N=2\), the finite sum is

$$ \begin{aligned} \sum_{n=1}^{2}\frac{1}{n(n+3)} &=\frac{1}{3}\left[ \left(1-\frac{1}{4}\right) +\left(\frac{1}{2}-\frac{1}{5}\right) \right]\\ &=\frac{1}{3}\left(\frac{3}{4}+\frac{3}{10}\right) =\frac{1}{3}\left(\frac{15}{20}+\frac{6}{20}\right) =\frac{7}{20}. \end{aligned} $$

Checking against the original terms gives \(1/(1\cdot4)+1/(2\cdot5)=1/4+1/10=5/20+2/20=7/20\), so the partial sum is correct. For the infinite sum, \(H_3=1+1/2+1/3=6/6+3/6+2/6=11/6\). The theorem therefore gives

$$ \sum_{n=1}^{\infty}\frac{1}{n(n+3)} = \frac{H_3}{3} = \frac{11}{18}. $$

As a limit check, the partial sum is \( (1/3)(H_N+H_3-H_{N+3})\). The difference \(H_{N+3}-H_N=1/(N+1)+1/(N+2)+1/(N+3)\) tends to zero, leaving \(H_3/3=11/18\).

A common coefficient error

A frequent mistake is to omit the factor \(1/k\). For \(k=2\), writing \(1/[n(n+2)]=1/n-1/(n+2)\) is incorrect. At \(n=1\), the left-hand side is \(1/(1\cdot3)=1/3\), while the proposed right-hand side is \(1-1/3=2/3\). They are not equal.

The correction follows directly from the common-denominator calculation: \(1/n-1/(n+2)=2/[n(n+2)]\), so the difference must be divided by \(2\). More generally, the numerator of \(1/n-1/(n+k)\) is \(k\), which is why the correct coefficient is \(1/k\). A second useful check is to test any proposed decomposition at a small value such as \(n=1\) before summing it.

When this method is useful

Look for this method when a term has two factors in its denominator, one of which is the other plus a fixed positive integer. The decomposition replaces the product with a difference whose terms can cancel across successive indices. After that, keep the finite partial sum visible: it shows both what cancels and what remains at the endpoints.

For an infinite series, do not infer the sum just from seeing cancellation in a few terms. Use the exact finite partial-sum formula and take its limit. Here the uncancelled part consists of a fixed number \(k\) of terms, each tending to zero; the bound \(k/(N+1)\) verifies that their total tends to zero. That final limit step is what turns a pattern of finite cancellation into a value for the infinite series.

Check Your Understanding

Use the decomposition and partial-sum reasoning from this tutorial to answer the following questions.

  1. Write \(1/[n(n+4)]\) as a scaled difference of reciprocals.
  2. Evaluate \(\sum_{n=1}^{3}1/[n(n+1)]\) by cancellation.
  3. State the finite-sum formula for \(\sum_{n=1}^{N}1/[n(n+k)]\) using harmonic numbers.
  4. What bound shows that the final \(k\) reciprocal terms tend to zero as \(N\) grows?
  5. Find the value of \(\sum_{n=1}^{\infty}1/[n(n+2)]\).