What Is An Alternating Series?
An alternating series is an infinite sum whose terms switch sign from one to the next. You strip out the sign with a factor of $(-1)^n$ or $(-1)^{n+1}$ and write the leftover positive sizes as $b_n \ge 0$:
$$\sum_{n=1}^{\infty} (-1)^{n+1} b_n = b_1 - b_2 + b_3 - b_4 + \cdots$$
The $(-1)^{n+1}$ makes the first term positive; using $(-1)^n$ instead makes the first term negative. Either way, the $b_n$ carry the actual magnitudes, and the sign factor only decides the pattern of plus and minus.
Three quick examples fix the idea:
Alternating harmonic series: $1 - \tfrac12 + \tfrac13 - \tfrac14 + \cdots$, where $b_n = \tfrac{1}{n}$.
Leibniz's series for $\pi$: $1 - \tfrac13 + \tfrac15 - \tfrac17 + \cdots$, where $b_n = \tfrac{1}{2n-1}$.
A geometric one: $-\tfrac12 + \tfrac14 - \tfrac18 + \cdots$, where $b_n = \tfrac{1}{2^n}$.
Alternating series sit inside the wider study of infinite series, and deciding whether one adds up to a finite number is a question of convergence and divergence of series. What makes the alternating kind special is that the constant sign-flipping gives them a convergence test of their own, one that is easier to apply than the ratio test or comparison test.
What Is The Alternating Series Test?
The Alternating Series Test, also called the Leibniz criterion, gives two simple conditions on the sizes $b_n$ that guarantee an alternating series converges.
The Alternating Series Test
The series $\displaystyle\sum_{n=1}^{\infty} (-1)^{n+1} b_n$ (with every $b_n > 0$) converges if both of these hold:
The terms are non-increasing: $b_{n+1} \le b_n$ for all $n$ beyond some point.
The terms shrink to zero: $\displaystyle\lim_{n \to \infty} b_n = 0$.
Both conditions are needed. If the terms do not fall to zero, the test does not apply, and in fact the divergence test already kills the series: any series whose terms miss zero cannot converge. If the terms fall to zero but do not decrease steadily, the guarantee is lost, though such cases are rare in a first course.
One warning that saves marks: the Alternating Series Test can only ever confirm convergence. It never proves divergence. When the conditions fail, you learn nothing from this test and must try another, usually the divergence test for a limit that misses zero.
Why Does The Alternating Series Test Work?
The reason is geometric, and it also hands you the error bound for free. Look at the partial sums $S_N$, the totals after $N$ terms.
Group the terms of $S_{2m}$ (an even number of them) in pairs:
$$S_{2m} = (b_1 - b_2) + (b_3 - b_4) + \cdots + (b_{2m-1} - b_{2m})$$
Because the terms decrease, every bracket is $\ge 0$, so the even partial sums climb: $S_2 \le S_4 \le S_6 \le \cdots$. Regroup the same sum a second way:
$$S_{2m} = b_1 - (b_2 - b_3) - (b_4 - b_5) - \cdots - b_{2m}$$
Now every bracket is subtracted and every bracket is $\ge 0$, so $S_{2m} \le b_1$. The even partial sums are increasing and capped by $b_1$, so they close in on a limit $S$. The odd partial sums satisfy $S_{2m+1} = S_{2m} + b_{2m+1}$, and since $b_{2m+1} \to 0$, they chase the same limit $S$. Both halves meet, so $S_N \to S$ and the series converges.
The picture is a marker hopping right, then left, then right by ever-shorter steps. Each hop crosses the limit $S$, so $S$ is always trapped between two consecutive partial sums. That trapping is exactly the estimation bound derived below.
What Is The Alternating Harmonic Series And Why Does It Equal ln 2?
The alternating harmonic series is the headline example:
$$\sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n} = 1 - \frac12 + \frac13 - \frac14 + \cdots$$
Its sizes $b_n = \tfrac{1}{n}$ are positive, decreasing, and tend to zero, so the Alternating Series Test says it converges. The value it converges to is $\ln 2$.
That value comes straight from the power-series expansion of the natural logarithm. The power series for $\ln(1+x)$ is
$$\ln(1+x) = x - \frac{x^2}{2} + \frac{x^3}{3} - \frac{x^4}{4} + \cdots, \qquad -1 < x \le 1.$$
Set $x = 1$, which is exactly the endpoint where the expansion still holds:
$$\ln 2 = 1 - \frac12 + \frac13 - \frac14 + \cdots \approx 0.6931.$$
The plain harmonic series $1 + \tfrac12 + \tfrac13 + \cdots$ has the same terms without the signs, and it diverges. Flipping every second sign is the entire difference between a sum that blows up and one that settles on $\ln 2$. That contrast is the doorway to the next idea.
What Is The Difference Between Absolute And Conditional Convergence?
Take an alternating series that converges and ask a second question: does it still converge if you make every term positive? The answer splits convergent series into two camps.
A series is absolutely convergent when the series of absolute values $\sum \lvert a_n \rvert$ also converges. The signs were not doing the work; the sum would hold up even without them.
A series is conditionally convergent when $\sum a_n$ converges but $\sum \lvert a_n \rvert$ diverges. Here the alternating signs are the only reason it converges at all.
The alternating harmonic series is the model of conditional convergence: it converges to $\ln 2$, but its absolute version is the divergent harmonic series. By contrast, $\sum \tfrac{(-1)^{n+1}}{n^2}$ is absolutely convergent, because $\sum \tfrac{1}{n^2}$ converges on its own as a $p$-series with $p = 2$.
This is not a bookkeeping label. Absolutely convergent series behave like ordinary finite sums: you may reorder them freely and the total never changes. Conditionally convergent series do not. That fragility has a startling consequence, taken up in the history section below.
How Do You Estimate The Error Of An Alternating Series?
Because each partial sum overshoots the true value $S$, the leftover after $N$ terms is easy to bound. The leftover is the remainder $R_N = S - S_N$.
Alternating Series Estimation Theorem
If $\sum (-1)^{n+1} b_n$ satisfies the two Alternating Series Test conditions, then the remainder after $N$ terms obeys $$\lvert R_N \rvert = \lvert S - S_N \rvert \le b_{N+1}.$$ The error is at most the size of the first term you left out, and it carries that term's sign.
Read the bound carefully: the ceiling on the error is $b_{N+1}$, the first dropped term, not $b_N$, the last term you kept. Getting that off by one is the most common slip on this topic. Because $S$ sits between $S_N$ and $S_{N+1}$, the true value is always on the side of the next step, so the sign of the error matches the sign of $b_{N+1}$ in the series.
This bound is why alternating series are prized in computation: it tells you in advance how many terms guarantee a target accuracy. To pin a value to within $0.001$, keep adding terms until the next one drops below $0.001$, and stop.
How Do You Apply The Alternating Series Test? Worked Examples
Each example checks the two conditions first, then names the type of convergence. Every numeric claim is verified.
Example 1: The alternating harmonic series.
Test $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n}$.
Here $b_n = \tfrac1n$. It is positive, $b_{n+1} = \tfrac{1}{n+1} \le \tfrac1n = b_n$, and $\lim_{n\to\infty}\tfrac1n = 0$. Both conditions hold, so the series converges. The absolute version $\sum \tfrac1n$ diverges, so the convergence is conditional.
Final answer: converges conditionally (to $\ln 2$).
Example 2: An absolutely convergent case.
Test $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n^2}$.
The sizes $b_n = \tfrac{1}{n^2}$ decrease to zero, so the Alternating Series Test gives convergence. Now check the absolute series $\sum \tfrac{1}{n^2}$: it is a $p$-series with $p = 2 > 1$, so it converges. Because the absolute version converges, the original is absolutely convergent.
Final answer: converges absolutely.
Example 3: A series that fails the test and diverges.
Test $\displaystyle\sum_{n=1}^{\infty} (-1)^{n},\frac{n}{n+1}$.
The sizes are $b_n = \tfrac{n}{n+1}$, and $\lim_{n\to\infty}\tfrac{n}{n+1} = 1 \ne 0$. The terms do not shrink to zero, so the Alternating Series Test does not apply. More than that, the divergence test settles it: since the terms fail to approach zero, the series diverges outright.
Final answer: diverges.
Example 4: Estimating a sum with a guaranteed error.
Approximate $\displaystyle\sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n^2}$ using four terms, and bound the error.
The partial sum is
$$S_4 = 1 - \frac14 + \frac19 - \frac{1}{16} = 0.7986 \ (\text{to 4 dp}).$$
The first dropped term is $b_5 = \tfrac{1}{25} = 0.04$, so the estimation theorem gives $\lvert R_4 \rvert \le 0.04$. The true sum is $\tfrac{\pi^2}{12} \approx 0.8225$, and indeed $\lvert 0.8225 - 0.7986 \rvert = 0.0239 \le 0.04$, well inside the guarantee.
Final answer: $S \approx 0.7986$ with error at most $0.04$.
Which Convergence Test Should You Use?
The Alternating Series Test is one tool among several. When a series lands on your desk, its shape usually points to the right test.
Table: Matching a series to the convergence test that settles it fastest.
Series shape | First test to reach for | Verdict it gives |
|---|---|---|
Terms do not approach $0$ | Diverges | |
$\sum ar^{n}$, constant ratio | Geometric series rule | Converges if $\lvert r \rvert < 1$ |
$\sum \tfrac{1}{n^{p}}$ | $p$-series rule | Converges if $p > 1$ |
$\sum (-1)^{n} b_n$, $b_n \downarrow 0$ | Alternating Series Test | Converges (check absolute vs conditional) |
Factorials or $n$th powers | Converges if the limit $< 1$ | |
Looks like a known series | Matches the comparison |
For an alternating series, the smart order is: first check whether the absolute series converges by one of the other tests. If it does, you have absolute convergence and are done. If it does not, fall back on the Alternating Series Test to catch the conditional convergence the signs provide.
Who Discovered The Alternating Series Test?
The test carries the name of one of the two inventors of calculus, and its deepest consequence was uncovered a century and a half later.
Two more names sit close to this story:
Gottfried Wilhelm Leibniz (1646–1716, Germany) also gave the world the $\int$ sign and the alternating series for $\pi$ that still bears his name.
Bernhard Riemann (1826–1866, Germany) reshaped analysis, geometry, and number theory, and his rearrangement theorem is the classic caution attached to every conditionally convergent sum.
Where Is The Alternating Series Used In The Real World?
Alternating series are the workhorses of "compute a number to a known accuracy," because the error bound is so cheap to state.
Computing constants: $\ln 2$, $\pi$ (through Leibniz's series), and many logarithm and inverse-tangent values are evaluated from alternating series with a guaranteed number of correct digits.
Physics and engineering: damped oscillations, diffraction patterns, and perturbation calculations produce alternating contributions that partly cancel, and the estimation bound says how many to keep.
Signal processing: the Fourier series of a square wave has coefficients that alternate in sign, and truncating the sum to a fixed accuracy relies on the same term-by-term control.
Numerical methods: because the true value is trapped between consecutive partial sums, alternating series give both an estimate and an automatic error bar in one stroke, which is rare and valuable in scientific computing.
One idea, "shrinking terms with flipping signs pin down a value," turns up wherever a quantity is built from partly cancelling pieces.
What Are The Most Common Mistakes With Alternating Series?
These four errors account for most lost marks, and each matches a question students actually ask on r/calculus, r/learnmath, and course error handouts.
Checking the limit but not the decrease.
Where it slips in:
A student sees $b_n \to 0$, declares convergence, and never confirms the terms are decreasing.
Don't do this:
Do not stop at the limit condition. Both conditions are required, and skipping the decrease check is the single most common oversight.
The correct way:
Confirm $b_{n+1} \le b_n$ as well as $\lim b_n = 0$. Show the decrease with a ratio, a difference, or the derivative of the matching function.
Treating a failed test as proof of divergence.
Where it slips in:
The conditions fail, so a student writes "therefore the series diverges."
Don't do this:
Do not read a failed Alternating Series Test as a divergence result. This test only ever confirms convergence.
The correct way:
If the terms miss zero, cite the divergence test to conclude divergence. If they reach zero but do not decrease, switch to a different test; the Alternating Series Test simply says nothing.
Using the wrong term in the error bound.
Where it slips in:
After summing $N$ terms, a student bounds the error by $b_N$, the last term added.
Don't do this:
Do not use the last term kept. The bound is set by the first term dropped.
The correct way:
Write $\lvert R_N \rvert \le b_{N+1}$. To reach an error below a target, keep terms until the next one falls under that target, then stop.
Confusing conditional with absolute convergence.
Where it slips in:
A student proves an alternating series converges and calls it absolutely convergent without checking the absolute version.
Don't do this:
Do not assume convergence is absolute. The alternating harmonic series converges yet its absolute version diverges.
The correct way:
Test $\sum \lvert a_n \rvert$ separately. If it converges, the series is absolutely convergent; if it diverges while the alternating series converges, the convergence is only conditional.
Practice Problems On Alternating Series
Work each one, then check against the answer. Answers are verified.
Does $\displaystyle\sum_{n=1}^{\infty}\frac{(-1)^{n+1}}{2n-1}$ converge, and how?
(Answer: $b_n = \tfrac{1}{2n-1}$ decreases to $0$, so it converges; the absolute series diverges, so it is conditionally convergent, this is Leibniz's $\tfrac{\pi}{4}$ series.)Classify $\displaystyle\sum_{n=1}^{\infty}\frac{(-1)^{n}}{2^{n}}$.
(Answer: $\sum \tfrac{1}{2^n}$ is a convergent geometric series, so the series is absolutely convergent; its value is $-\tfrac13$.)Does $\displaystyle\sum_{n=1}^{\infty}(-1)^{n},\frac{n+1}{n}$ converge?
(Answer: $b_n = \tfrac{n+1}{n} \to 1 \ne 0$, so it diverges by the divergence test.)How many terms of $\displaystyle\sum_{n=1}^{\infty}\frac{(-1)^{n+1}}{n^{3}}$ guarantee an error below $0.01$?
(Answer: need $b_{N+1} = \tfrac{1}{(N+1)^3} < 0.01$; since $\tfrac{1}{5^3} = 0.008 < 0.01$ but $\tfrac{1}{4^3} = 0.0156$, take $N = 4$ terms.)Is $\displaystyle\sum_{n=1}^{\infty}\frac{(-1)^{n+1}}{\sqrt{n}}$ absolute or conditional?
(Answer: $b_n = \tfrac{1}{\sqrt n}$ decreases to $0$, so it converges; the absolute series is a $p$-series with $p = \tfrac12 \le 1$ and diverges, so it is conditionally convergent.)Bound the error when the alternating harmonic series is cut to its first three terms.
(Answer: $\lvert R_3 \rvert \le b_4 = \tfrac14 = 0.25$; the partial sum $S_3 = \tfrac56 \approx 0.8333$ sits within $0.25$ of $\ln 2 \approx 0.6931$.)
Where Should You Go Next After Alternating Series?
The Alternating Series Test is one stop on the tour of infinite sums, and several natural doors open from here.
Convergence and divergence of series. The full map of tests, so you always know which one to reach for.
The ratio test. The go-to check for absolute convergence, and the fastest route through factorials and powers.
Taylor series. Where alternating series come from in practice, since many function expansions alternate and carry this exact error bound.
If you are meeting alternating series for the first time, a live Bhanzu trainer teaches it from the trapping picture up, so the test and its error bound feel like one idea, in the Bhanzu math program.
Was this article helpful?
Your feedback helps us write better content