When we know a series [latex]\displaystyle\sum_{n=1}^{\infty} a_n[/latex] converges, we often want to estimate its sum. We can approximate this sum using any finite partial sum [latex]\displaystyle\sum_{n=1}^{N} a_n[/latex] where [latex]N[/latex] is a positive integer.
The key question is: How good is this approximation?
When we approximate an infinite series with its [latex]N[/latex]th partial sum, we define the remainder as:
This remainder [latex]R_N[/latex] represents the “error” in our approximation—how much we’re missing by stopping at the [latex]N[/latex]th term instead of continuing infinitely.
For series that satisfy the conditions of the integral test, we can estimate how large this remainder is.
remainder estimate from the integral test
Suppose [latex]\displaystyle\sum _{n=1}^{\infty }{a}_{n}[/latex] is a convergent series with positive terms. Suppose there exists a function [latex]f[/latex] satisfying the following three conditions:
[latex]f[/latex] is continuous,
[latex]f[/latex] is decreasing, and
[latex]f\left(n\right)={a}_{n}[/latex] for all integers [latex]n\ge 1[/latex].
Let [latex]S_N[/latex] be the [latex]N[/latex]th partial sum. Then:
This gives us upper and lower bounds on how much error we make when approximating the series with [latex]S_N[/latex].
Visualizing the Remainder Estimate
Figure 4 illustrates how the remainder estimate works.
Figure 4. Given a continuous, positive, decreasing function [latex]f[/latex] and a sequence of positive terms [latex]{a}_{n}[/latex] such that [latex]{a}_{n}=f\left(n\right)[/latex] for all positive integers [latex]n[/latex], (a) the areas [latex]{a}_{N+1}+{a}_{N+2}+{a}_{N+3}+\cdots <{\displaystyle\int }_{N}^{\infty }f\left(x\right)dx[/latex], or (b) the areas [latex]{a}_{N+1}+{a}_{N+2}+{a}_{N+3}+\cdots >{\displaystyle\int }_{N+1}^{\infty }f\left(x\right)dx[/latex]. Therefore, the integral is either an overestimate or an underestimate of the error.
We can represent the remainder [latex]R_N = a_{N+1} + a_{N+2} + a_{N+3} + \cdots[/latex] as the sum of areas of rectangles.
From the visual comparison, we see that the total area of these rectangles is:
Bounded above by [latex]\int_N^{\infty} f(x)dx[/latex]
Bounded below by [latex]\int_{N+1}^{\infty} f(x)dx[/latex]
This result gives you a “sandwich” estimate for your series. Calculate [latex]S_N[/latex] (which you can compute exactly), then add the lower and upper integral bounds to get a range where the true sum must lie. The integrals tell you either an overestimate or underestimate of your approximation error.
Consider the series [latex]\displaystyle\sum _{n=1}^{\infty }\frac{1}{{n}^{3}}[/latex].
Calculate [latex]{S}_{10}=\displaystyle\sum _{n=1}^{10}\frac{1}{{n}^{3}}[/latex] and estimate the error.
Determine the least value of [latex]N[/latex] necessary such that [latex]{S}_{N}[/latex] will estimate [latex]\displaystyle\sum _{n=1}^{\infty }\frac{1}{{n}^{3}}[/latex] to within [latex]0.001[/latex].
Therefore, the error is [latex]{R}_{10}<\frac{1}{2{\left(10\right)}^{2}}=0.005[/latex].
Find [latex]N[/latex] such that [latex]{R}_{N}<0.001[/latex]. In part a. we showed that [latex]{R}_{N}<\frac{1}{2{N}^{2}}[/latex]. Therefore, the remainder [latex]{R}_{N}<0.001[/latex] as long as [latex]\frac{1}{2{N}^{2}}<0.001[/latex]. That is, we need [latex]2{N}^{2}>1000[/latex]. Solving this inequality for [latex]N[/latex], we see that we need [latex]N>22.36[/latex]. To ensure that the remainder is within the desired amount, we need to round up to the nearest integer. Therefore, the minimum necessary value is [latex]N=23[/latex].