What Is The Alternating Series Test?
The Alternating Series Test is a convergence test for a series whose terms switch sign every step. Such a series is written $\sum_{n=1}^{\infty} (-1)^{n} b_n$ or $\sum_{n=1}^{\infty} (-1)^{n+1} b_n$, where each $b_n > 0$ is the size of a term with its sign stripped off. The test gives a clean, two-part condition for deciding whether that sum converges to a finite number.
The theorem states its hypotheses precisely. If the positive terms $b_n$ satisfy
$$b_{n+1} \le b_n \ \text{ for all } n \ge N_0, \qquad \text{and} \qquad \lim_{n\to\infty} b_n = 0,$$
then the alternating series converges. In words: the terms must eventually stop growing and must shrink all the way to zero. Meet both, and the sum lands on a value; miss either one, and the test says nothing.
Two cautions are built into the statement, and both matter later:
The test is one-directional. It can confirm convergence, but it can never prove divergence. If the conditions fail, you switch to a different tool, usually the divergence test.
The test only promises the sum exists. It does not promise the series would still converge if you removed the signs. That gap is the whole story of absolute versus conditional convergence, covered below.
For where this test sits among the others, see the wider map of convergence and divergence of series.
What Are The Two Conditions Of The Alternating Series Test?
Everything rests on the two hypotheses, so it is worth reading each one slowly. Both are about the positive part $b_n$, never about the signs, which are already handled by the $(-1)^n$ factor.
Condition 1: the terms are eventually decreasing. You need $b_{n+1} \le b_n$ from some point on. The word "eventually" is deliberate: the first few terms are allowed to jump around, because a finite head does not change whether an infinite tail converges. Check it by comparing $b_{n+1}$ with $b_n$ directly, or by treating $b_n$ as a function $f(n)$ and showing $f'(x) \le 0$ for large $x$.
Condition 2: the terms shrink to zero. You need $\lim_{n\to\infty} b_n = 0$. This is the same limit-of-a-sequence idea used everywhere else in series work; see limit of a sequence. If this limit is anything other than zero, the series cannot converge, and the alternating structure does not rescue it.
Both conditions are required. A term sequence can march to zero without decreasing, and a decreasing sequence need not reach zero. Only when the two hold together does the alternating structure force convergence.
How Do You Prove The Alternating Series Test?
The proof is short and geometric, and it explains the picture in the hook image. Take the partial sums $S_N = \sum_{n=1}^{N} (-1)^{n+1} b_n$ and split them into the even-numbered and odd-numbered ones.
Look first at the even partial sums $S_2, S_4, S_6, \dots$. Grouping the terms in pairs,
$$S_{2k} = (b_1 - b_2) + (b_3 - b_4) + \dots + (b_{2k-1} - b_{2k}).$$
Because $b_n$ is decreasing, every bracket is $\ge 0$, so the even partial sums are increasing. Regroup the same sum a second way,
$$S_{2k} = b_1 - (b_2 - b_3) - (b_4 - b_5) - \dots - b_{2k},$$
and every removed bracket is $\ge 0$, so $S_{2k} \le b_1$. The even partial sums increase but never pass $b_1$, so by the monotone convergence theorem they approach a limit $S$.
The odd partial sums close the argument. Since $S_{2k+1} = S_{2k} + b_{2k+1}$ and $b_{2k+1} \to 0$, the odd sums approach the same limit $S$. Both subsequences meet at $S$, so the full sequence $S_N \to S$, and the series converges. The even sums sit below $S$, the odd sums sit above it, and each new term steps across the limit, which is exactly why the running total is trapped from both sides.
How Do You Use The Alternating Series Test? Worked Examples
Each example checks the two conditions in order, then states the conclusion. Reading the conditions first, before any computation, is the habit that avoids the mistakes later in this article.
Example 1: The alternating harmonic series.
Test $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n} = 1 - \frac{1}{2} + \frac{1}{3} - \frac{1}{4} + \cdots$
Here $b_n = \dfrac{1}{n}$. Condition 1: $\dfrac{1}{n+1} \le \dfrac{1}{n}$ for every $n$, so the terms decrease. Condition 2: $\lim_{n\to\infty}\dfrac{1}{n} = 0$. Both hold, so the series converges, to the known value $\ln 2 \approx 0.6931$.
Final answer: the alternating harmonic series converges (to $\ln 2$).
Example 2: A slower alternating series.
Test $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n}}{\sqrt{n}} = -1 + \frac{1}{\sqrt{2}} - \frac{1}{\sqrt{3}} + \cdots$
Here $b_n = \dfrac{1}{\sqrt{n}}$. Condition 1: $\sqrt{n+1} > \sqrt{n}$, so $\dfrac{1}{\sqrt{n+1}} \le \dfrac{1}{\sqrt{n}}$, and the terms decrease. Condition 2: $\lim_{n\to\infty}\dfrac{1}{\sqrt{n}} = 0$, so both hold and the series converges. Note that the un-signed version $\sum \dfrac{1}{\sqrt{n}}$ is a $p$-series with $p = \tfrac12 < 1$, so it diverges, a point we return to under conditional convergence.
Final answer: $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n}}{\sqrt{n}}$ converges.
Example 3: When the test does not apply.
Test $\displaystyle\sum_{n=1}^{\infty} (-1)^{n},\frac{n}{n+1} = -\frac{1}{2} + \frac{2}{3} - \frac{3}{4} + \cdots$
Here $b_n = \dfrac{n}{n+1}$. Check Condition 2 first: $\lim_{n\to\infty}\dfrac{n}{n+1} = 1 \neq 0$. The terms do not shrink to zero, so the Alternating Series Test does not apply. Because the individual terms $(-1)^n \tfrac{n}{n+1}$ do not approach $0$, the divergence test settles it: the series diverges.
Final answer: $\displaystyle\sum_{n=1}^{\infty} (-1)^{n},\frac{n}{n+1}$ diverges.
What Is The Alternating Series Error Bound?
The most useful feature of an alternating series is that it comes with a built-in accuracy guarantee. If the two conditions hold and you stop after $N$ terms, the leftover, called the remainder $R_N = S - S_N$, is no bigger than the very next term:
$$\lvert R_N \rvert = \lvert S - S_N \rvert \le b_{N+1}.$$
The proof is already done: the limit $S$ sits between consecutive partial sums, so the distance from $S_N$ to $S$ can be at most the size of the next step, $b_{N+1}$. No other convergence test hands you an error this cheaply. A useful phrase to remember is "the next term is the most you can be off by."
Example 4: Bound the error for an approximation.
Approximate $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n^{2}}$ using the first four terms, and bound the error.
The partial sum is
$$S_4 = 1 - \frac{1}{4} + \frac{1}{9} - \frac{1}{16} = 1 - 0.2500 + 0.1111 - 0.0625 = 0.7986.$$
The error bound is the next term, $b_5 = \dfrac{1}{25} = 0.0400$, so $\lvert S - S_4\rvert \le 0.0400$. The true value of this series is $\dfrac{\pi^2}{12} \approx 0.8225$, and the actual error is $0.8225 - 0.7986 = 0.0239$, comfortably inside the guaranteed $0.0400$.
Final answer: $S_4 = 0.7986$, with error at most $0.0400$ (true value $\approx 0.8225$).
You can also run the bound backwards to decide how many terms you need. To force the error below $0.01$, require $b_{N+1} = \dfrac{1}{(N+1)^2} \le 0.01$, so $(N+1)^2 \ge 100$, giving $N + 1 \ge 10$ and $N \ge 9$. Nine terms guarantee two-decimal accuracy, and you know that before computing a single one.
What Is The Difference Between Absolute And Conditional Convergence?
An alternating series can converge for two very different reasons, and telling them apart is where the topic earns its depth.
A series $\sum a_n$ is absolutely convergent when the series of sizes $\sum \lvert a_n\rvert$ also converges. It is conditionally convergent when $\sum a_n$ converges but $\sum \lvert a_n\rvert$ diverges, so the convergence depends entirely on the cancellation between positive and negative terms.
Table: Two alternating series that converge for opposite reasons.
Series | Converges? (by Leibniz) | Series of absolute values | Verdict |
|---|---|---|---|
$\sum \dfrac{(-1)^{n+1}}{n}$ | Yes | $\sum \dfrac{1}{n}$ diverges (harmonic) | Conditional |
$\sum \dfrac{(-1)^{n+1}}{n^{2}}$ | Yes | $\sum \dfrac{1}{n^{2}}$ converges ($p = 2$) | Absolute |
The alternating harmonic series is the textbook conditional case: it sums to $\ln 2$ only because the minus signs keep pulling the total back. Strip the signs and you have the harmonic series, which grows without bound. By contrast, $\sum \dfrac{(-1)^{n+1}}{n^{2}}$ converges absolutely, because even the all-positive version $\sum \dfrac{1}{n^{2}}$ converges. To classify a series, test the absolute version with a tool like the comparison test or the ratio test; if that converges, the original is absolute, and if it diverges while Leibniz still gives convergence, the original is conditional.
Why Does The Alternating Series Test Work?
The result can feel like a trick the first time, because the un-signed terms of a conditionally convergent series add up to infinity. The reason it works is the bracketing in the proof, seen three ways.
The steps overshoot by less each time. Each new term carries you across the limit $S$, but because the terms shrink, every crossing is shorter than the last. The running total zig-zags in on $S$ with ever-smaller swings, so it has nowhere to go but the middle.
The limit is boxed in from both sides. The even partial sums climb toward $S$ from below, the odd ones fall toward it from above, and the gap between them is a single term $b_{N+1}$ that shrinks to zero. Two sequences squeezing a fixed value from opposite sides can only agree on one number.
Cancellation does the work that size cannot. In a conditionally convergent series, the positive terms alone and the negative terms alone each diverge. Convergence is not about the terms being small enough on their own; it is about the alternating signs cancelling most of each term before it can accumulate.
That last point is the deep one. It is also why rearranging a conditionally convergent series can change its sum, a warning that shows up in the mistakes section.
Who Discovered The Alternating Series Test?
The rule is old enough that it predates the modern language of limits by well over a century.
Two later figures gave the idea its rigorous frame:
Augustin-Louis Cauchy (1789–1857, France) put convergence itself on a precise footing with the modern definition of a limit, which is what turns Leibniz's picture of shrinking hops into a theorem.
Bernhard Riemann (1826–1866, Germany) exposed how strange conditional convergence really is: his rearrangement theorem shows that the terms of a conditionally convergent series, such as the alternating harmonic series, can be reordered to sum to any value at all.
Where Is The Alternating Series Test Used In The Real World?
The test is quietly behind any calculation that needs a number and a guaranteed accuracy in the same breath.
Computing constants by hand or by machine: classic alternating series give $\ln 2$ and $\pi$ (through Leibniz's $\tfrac{\pi}{4}$ series), and the error bound tells you exactly how many terms to add for a target number of decimals.
Evaluating functions on a calculator or chip: the sine, cosine, and exponential routines inside a device sum alternating series, and the remainder bound is what lets the firmware stop the moment the answer is accurate enough.
Signal processing and Fourier analysis: the Fourier series of a square or sawtooth wave alternates in sign, and the partial-sum error bound governs how sharply a truncated series reproduces the signal.
Engineering approximations: oscillating physical models, from damped alternating currents to perturbation expansions, rely on the guarantee that stopping early costs at most the first dropped term.
One convergence rule lets a person, a calculator, and a signal processor all trade a small, known error for a finite amount of work, which is why it survives from a 1676 manuscript into modern computing.
What Are The Most Common Mistakes With The Alternating Series Test?
These four errors account for most lost marks on the topic, and each matches a question real students ask on r/calculus, r/learnmath, and course error handouts.
Checking only that the terms go to zero.
Where it slips in:
A student sees $b_n \to 0$, declares convergence, and never checks that $b_n$ is decreasing.
Don't do this:
Do not treat $\lim_{n\to\infty} b_n = 0$ as the whole test. It is one of two required conditions.
The correct way:
Verify both hypotheses every time: show $b_{n+1} \le b_n$ (eventually) and $\lim_{n\to\infty} b_n = 0$. Only then does the test apply.
Ignoring the word "eventually" in the decreasing condition.
Where it slips in:
A student sees the first two or three terms grow, panics, and declares the test unusable, even though the terms decrease from some point on.
Don't do this:
Do not reject the series because of a finite, non-decreasing head. A finite number of early terms never changes convergence.
The correct way:
Show the terms decrease for all $n$ beyond some fixed $N_0$. A differentiable model $f(n) = b_n$ with $f'(x) \le 0$ for large $x$ confirms the eventual decrease.
Assuming convergence means absolute convergence.
Where it slips in:
A student proves the alternating harmonic series converges and then treats it as if $\sum \tfrac{1}{n}$ converged too, reordering terms freely.
Don't do this:
Do not assume the un-signed series behaves. The Alternating Series Test says nothing about $\sum \lvert a_n\rvert$.
The correct way:
Test the absolute version separately. If $\sum \lvert a_n\rvert$ diverges, the series is only conditionally convergent, and rearranging it can change the sum (Riemann's theorem).
Using the test to conclude divergence.
Where it slips in:
A student finds the terms are not decreasing, then writes "therefore the series diverges."
Don't do this:
Do not read a failed condition as a proof of divergence. The test is a one-way street to convergence only.
The correct way:
If $\lim_{n\to\infty} b_n \neq 0$, use the divergence test to conclude divergence. If the terms are simply not monotonic but still reach zero, the test is inconclusive, and another tool is needed.
Practice Problems On The Alternating Series Test
Work each one by checking the two conditions, then compare with the verified answer.
Does $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{2n-1}$ converge?
(Answer: $b_n = \tfrac{1}{2n-1}$ decreases to $0$, so it converges. This is Leibniz's series for $\tfrac{\pi}{4}$; convergence is conditional.)Classify $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n}}{n^{2}+1}$ as absolutely convergent, conditionally convergent, or divergent.
(Answer: $\sum \tfrac{1}{n^2+1}$ converges by comparison with $\sum \tfrac{1}{n^2}$, so it is absolutely convergent.)Does $\displaystyle\sum_{n=1}^{\infty} (-1)^{n},\frac{3n}{4n+1}$ converge?
(Answer: $b_n \to \tfrac{3}{4} \neq 0$, so the terms do not vanish and the series diverges by the divergence test.)Estimate the error if $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n^{3}}$ is approximated by its first three terms.
(Answer: error $\le b_4 = \tfrac{1}{64} \approx 0.0156$.)Does $\displaystyle\sum_{n=2}^{\infty} \frac{(-1)^{n}}{\ln n}$ converge?
(Answer: $b_n = \tfrac{1}{\ln n}$ decreases to $0$, so it converges; since $\sum \tfrac{1}{\ln n}$ diverges, the convergence is conditional.)Classify $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n}}{\sqrt[3]{n}}$.
(Answer: $b_n = n^{-1/3}$ decreases to $0$, so it converges; the absolute version is a $p$-series with $p = \tfrac13 < 1$, which diverges, so the convergence is conditional.)
Where Should You Go Next After The Alternating Series Test?
The test is one gate in the larger study of series, and several natural doors open from here.
Alternating series. Go deeper on the objects the test applies to, including their partial sums and value estimates.
Ratio test. The main tool for deciding absolute convergence, which the Alternating Series Test deliberately leaves open.
Infinite series. Step back to the full framework of convergence, partial sums, and the standard test hierarchy.
If your child is meeting convergence tests for the first time, a live Bhanzu trainer teaches the Alternating Series Test from the bracketing picture up, so the two conditions and the error bound feel like one idea, in the Bhanzu math program.
Was this article helpful?
Your feedback helps us write better content