# Alternating Series Error Bound
> AP Calculus BC · Unit 10: Infinite Sequences and Series
> Source: https://www.owlsprep.com/study/ap-calculus-bc-u10-alternating-series-error-bound/
This module covers the Alternating Series Remainder Theorem (Leibniz error bound), pre-requisite conditions, maximum error calculation, bounding the exact sum, and finding the number of terms needed for a given error tolerance, a high-yield AP Calculus BC topic.
**Prerequisites:** [Alternating series definition and convergence via Alternating Series Test](https://www.owlsprep.com/study/ap-calculus-bc-u10-alternating-series-convergence-test/); Partial sums and basic summation notation
## Learning objectives
- State the Alternating Series Remainder Theorem and its required preconditions
- Calculate the maximum error when approximating a sum with a partial sum
- Construct the tightest interval guaranteed to contain the exact sum of an alternating series
- Find the minimum number of terms needed to meet a given error tolerance
## Theorem Statement and Required Conditions
Alternating series error bound is a simple, powerful theorem that estimates the maximum possible error when you approximate the sum of a convergent alternating series with a finite partial sum. It is explicitly required by the AP Calculus BC CED, and appears regularly in both multiple-choice and free-response sections, often paired with Taylor polynomial approximation.
**Alternating Series Remainder Theorem** — For an alternating series meeting two conditions from the Alternating Series Test, the magnitude of the error when approximating the exact sum $S$ with the $n$th partial sum $S_n$ is at most the magnitude of the first neglected term $a_{n+1}$.
*Notation:* $|R_n| = |S - S_n| \leq a_{n+1}$
To apply the theorem, first write any alternating series in the standard form:
$$\sum_{k=1}^{\infty} (-1)^{k+1} a_k \quad \text{where } a_k > 0 \text{ for all } k$$
1. $\lim_{k \to \infty} a_k = 0$ (the sequence of positive terms approaches zero)
2. The sequence $\{a_k\}$ is strictly decreasing for all $k \geq n$
Intuitively, partial sums of a convergent alternating series oscillate around the exact sum, so the error after stopping at $S_n$ can never exceed the size of the next (first neglected) term.
**Worked example:** Consider the alternating series $\sum_{k=1}^{\infty} \frac{(-1)^{k+1}}{k^2}$. Does the alternating series error bound apply to an approximation using the first 4 terms? If yes, what is the maximum possible error?
1. Rewrite the series in standard form: $a_k = \frac{1}{k^2}$, which is positive for all $k \geq 1$.
2. Check the first condition:
3. $$\lim_{k \to \infty} a_k = \lim_{k \to \infty} \frac{1}{k^2} = 0$$
4. Check the second condition: $a_{k+1} = \frac{1}{(k+1)^2} < \frac{1}{k^2} = a_k$ for all $k \geq 1$, so $\{a_k\}$ is strictly decreasing.
5. For $n=4$ terms, the first neglected term is $a_5 = \frac{1}{5^2} = 0.04$. By the error bound, $|R_4| \leq 0.04$.
6. Conclusion: The error bound applies, maximum error is 0.04.
> **tip**
>
> Always explicitly confirm the two conditions (decreasing sequence, limit zero) before applying the error bound on FRQs. AP exam readers require this justification to award full credit.
## Constructing a Tight Interval for the Exact Sum
Once you have the partial sum $S_n$ and the error bound, you can construct an interval guaranteed to contain the exact sum $S$, a common AP exam question. In addition to the magnitude of the error, we know the error $R_n$ has the same sign as the first neglected term, which lets us create a tighter interval than the symmetric interval, which is what exam questions almost always expect.
- If first neglected term is positive: $S_n < S \leq S_n + a_{n+1}$
- If first neglected term is negative: $S_n - a_{n+1} \leq S < S_n$
**Worked example:** For the series $\sum_{k=1}^{\infty} \frac{(-1)^{k+1}}{2^k k}$, find the tightest possible interval that contains the exact sum $S$ using the first 3 terms.
1. Calculate the 3rd partial sum:
2. $$S_3 = \frac{1}{2^1 1} - \frac{1}{2^2 2} + \frac{1}{2^3 3} = \frac{10}{24} \approx 0.4167$$
3. Confirm error bound conditions: $a_k = \frac{1}{2^k k}$ is positive, strictly decreasing, and $\lim_{k\to\infty}a_k=0$, so the bound applies. The first neglected term is $a_4 = \frac{1}{2^4 4} = 0.015625$.
4. The 4th term of the series is $(-1)^{4+1}a_4 = -a_4$, so it is negative, meaning $R_3 = S - S_3$ is also negative, so $S < S_3$.
5. Combine magnitude and sign: $-a_4 \leq R_3 < 0$, so adding $S_3$ to all parts gives $S_3 - a_4 < S < S_3$.
6. Substitute values to get the final interval:
7. $$0.4167 - 0.015625 < S < 0.4167 \implies 0.401 < S < 0.417$$
> **tip**
>
> If an AP question asks for an interval containing the exact sum, always use the sign of the first neglected term to get a tight interval. Unnecessarily wide symmetric intervals will often be marked incorrect.
## Finding Minimum Number of Terms for a Given Error Tolerance
A common AP exam problem asks for the minimum number of terms needed to approximate the sum of an alternating series to within a given maximum error $E$. By the error bound, $|R_n| \leq a_{n+1}$, so we just need to find the smallest integer $n$ such that $a_{n+1} < E$. The most common mistake on this problem is confusing $n$ (number of terms used) with $n+1$ (index of the first neglected term).
**Worked example:** How many terms of the alternating series $\sum_{k=1}^{\infty} \frac{(-1)^{k+1}}{k!}$ are needed to approximate the sum to within 0.001?
1. Confirm conditions: $a_k = \frac{1}{k!}$ is positive, strictly decreasing, and $\lim_{k\to\infty}a_k=0$, so the error bound applies. We need $|R_n| < 0.001$, which requires $a_{n+1} < 0.001$.
2. Set up the inequality:
3. $$\frac{1}{(n+1)!} < 0.001 \implies (n+1)! > 1000$$
4. Calculate factorials: $6! = 720 < 1000$ and $7! = 5040 > 1000$, so $n+1 = 7$.
5. Solve for $n$: $n = 7 - 1 = 6$. Verify: $a_7 \approx 0.0002 < 0.001$ (meets requirement), while $n=5$ gives $a_6 \approx 0.0014 > 0.001$ (does not meet requirement).
> **tip**
>
> Always double-check what the question asks: if it asks for the number of terms, the answer is $n$, not $n+1$. This is the most common careless error on this problem type.
**Check your understanding**
Test your understanding with this AP-style multiple choice question:
1. How many terms of the convergent alternating series $\sum_{k=1}^{\infty} \frac{(-1)^{k+1}}{k^3}$ are needed to approximate the sum to within 0.01 of the exact value?
- A) 3
- B) 4
- C) 5
- D) 10
*Why:* Correct! We need $a_{n+1} < 0.01$, which simplifies to $(n+1)^3 > 100$. The smallest integer satisfying this is $n+1=5$, so $n=4$ terms are needed.
## Common pitfalls
- **Wrong:** Applying the alternating series error bound to an alternating series where $\{a_k\}$ is not decreasing for all $k \geq n$.
- Why it fails: Students forget the decreasing condition applies to all terms after $n$, not just the series as a whole.
- Correct: Always confirm $a_{k+1} < a_k$ for all $k \geq n$ before applying the bound, and only use the bound for $n \geq N$, where $N$ is the first index where the sequence becomes decreasing.
- **Wrong:** For a minimum terms problem, solving $a_n < E$ instead of $a_{n+1} < E$, leading to an answer one term too few.
- Why it fails: Students confuse the index of the last term used with the index of the first neglected term.
- Correct: Explicitly label your terms: if the last term you use is term $n$, the first neglected term is term $n+1$, so the inequality is always $a_{n+1} < E$.
- **Wrong:** Constructing a symmetric interval $S_n - a_{n+1} < S < S_n + a_{n+1}$ when asked for the tightest possible interval.
- Why it fails: Students memorize the magnitude bound but forget the sign rule that gives a tighter interval.
- Correct: Always check the sign of the first neglected term and adjust the interval to be one-sided, as shown in this guide.
- **Wrong:** Applying the alternating series error bound to a divergent alternating series.
- Why it fails: Students assume all alternating series are convergent.
- Correct: Always confirm $\lim_{k\to\infty}a_k=0$ (the first AST condition) before applying the error bound, since the theorem only applies to convergent series.
- **Wrong:** Using the alternating series error bound for the remainder of a positive-term Taylor series.
- Why it fails: Students confuse alternating series error bound with Lagrange error bound.
- Correct: Only use alternating series error bound for convergent alternating series meeting the AST conditions; use Lagrange error bound for general Taylor series with non-alternating signs.
## Cheatsheet
| Category | Formula/Rule | Notes |
| --- | --- | --- |
| Standard Form | $\sum_{k=1}^{\infty} (-1)^{k+1} a_k, \quad a_k>0$ | Any alternating series can be rewritten to fit |
| Pre-Conditions | 1. $\lim_{k\to\infty} a_k = 0$
2. $\{a_k\}$ strictly decreasing for $k \geq n$ | Both AST conditions required for the bound |
| Error Bound | $\|R_n\| = \|S - S_n\| \leq a_{n+1}$ | $S$ = exact sum, $a_{n+1}$ = first neglected term |
| Error Sign | $\text{sign}(R_n) = \text{sign(first neglected term)}$ | Used to build a tighter interval for $S$ |
| Tight Interval for $S$ | Positive neglected term: $S_n < S \leq S_n + a_{n+1}$
Negative neglected term: $S_n - a_{n+1} \leq S < S_n$ | This is the expected answer for AP FRQs |
| Minimum Terms for Error $E$ | Find smallest $n$ such that $a_{n+1} < E$ | $n$ = number of terms; common mistake uses $a_n < E$ |
| Symmetric Interval | $S_n - a_{n+1} < S < S_n + a_{n+1}$ | Always correct but wider than the tight interval |
## What's next
Alternating series error bound is a critical prerequisite for approximating sums of convergent series, and specifically for error analysis of alternating Taylor series, a commonly tested topic on the AP Calculus BC exam. After mastering this topic, you will apply alternating series error bound to find the error in alternating Taylor polynomial approximations; for these series, it is much simpler to apply than the Lagrange error bound, and it is a frequent source of points on both MCQ and FRQ sections. Without a solid understanding of this topic, you will struggle to justify error bounds for Taylor approximations, a high-weight FRQ skill, which makes up part of the ~17% of the AP Calculus BC exam devoted to infinite sequences and series.
- [Lagrange error bound for Taylor polynomials](https://www.owlsprep.com/study/ap-calculus-bc-u10-lagrange-error-bound/)
- [Finding Taylor polynomial approximations of functions](https://www.owlsprep.com/study/ap-calculus-bc-u10-finding-taylor-polynomial-approximations-of/)
- [Radius and interval of convergence of power series](https://www.owlsprep.com/study/ap-calculus-bc-u10-radius-and-interval-of-convergence/)
---
From [OwlsPrep](https://www.owlsprep.com) — free study guides for A-Level, IB, AP and IGCSE, written against the official syllabus. Canonical page: https://www.owlsprep.com/study/ap-calculus-bc-u10-alternating-series-error-bound/