Chapter 2 · Sequences and Series of Real Numbers

2.3 Series of Real Numbers

An infinite sum is the limit of its partial sums. We build the toolkit for deciding when that limit exists — comparison, condensation, integral, root, ratio, Raabe, Leibniz, Dirichlet and Abel — and see how fragile a conditionally convergent sum is.

A series $a_1+a_2+a_3+\cdots$ looks like an addition problem, but no one can add infinitely many numbers. What we can do is add the first $n$ of them and ask whether these running totals, the partial sums, form a convergent sequence. So everything in this section rests on §§2.1–2.2: a series converges when its sequence of partial sums converges, and the Cauchy criterion, the monotone convergence theorem and $\limsup$ do the real work. Series appear everywhere in analysis. The number $e$, the functions $e^x$, $\sin x$ and $\log(1+x)$, the solutions of differential equations and the Fourier expansion of a signal are all defined or computed by infinite series. Whether a numerical method converges, and how fast, is a question about the tail of a series.

The central difficulty is that we can rarely find the sum. Instead we compare: with geometric series (the ratio and root tests), with the $p$-series $\sum n^{-p}$ (comparison, condensation and integral tests, Raabe's test), and with the cancellation in alternating sums (the Leibniz, Dirichlet and Abel tests). The distinction between absolute and conditional convergence then turns out to be decisive. Absolutely convergent series behave like finite sums: they can be rearranged and multiplied freely. Conditionally convergent ones cannot, and Riemann's theorem says that by reordering their terms we can make them add up to any number we like. CSIR NET asks about series in almost every paper: the one convergent series among four, the values of $p$ or $x$ for which a series converges, and "which of the following are true" statements whose false options are the classic counterexamples collected in this section.

Series and Partial Sums; the Cauchy Criterion

📘 Definition 2.10 — Series, partial sums and sum
Let $(a_n)_{n\ge1}$ be a real sequence. The series $\sum_{n=1}^\infty a_n$ is the sequence of its partial sums $$s_n=a_1+a_2+\cdots+a_n .$$ The series converges to $s\in\mathbb{R}$, and $s$ is its sum, if $s_n\to s$; we write $\sum_{n=1}^\infty a_n=s$. Otherwise the series diverges. It diverges to $+\infty$ if $s_n\to+\infty$. The numbers $a_n$ are the terms, and for a convergent series $r_N=\sum_{n\gt N}a_n=s-s_N$ is the $N$-th remainder (or tail). Series may start at any index ($\sum_{n\ge0}$, $\sum_{n\ge2}$); the symbol $\sum a_n$ denotes both the series and, when it converges, its sum.

The definition turns every question about series into a question about the sequence $(s_n)$. Conversely every sequence $(x_n)$ is the sequence of partial sums of the series $x_1+\sum_{n\ge2}(x_n-x_{n-1})$, so series and sequences are two languages for the same thing. The first theorem translates the results of §2.1.

📐 Theorem 2.21 — Basic properties of series
  1. Linearity. If $\sum a_n=A$ and $\sum b_n=B$, then $\sum(\alpha a_n+\beta b_n)=\alpha A+\beta B$ for all $\alpha,\beta\in\mathbb{R}$.
  2. Cauchy criterion. $\sum a_n$ converges if and only if for every $\varepsilon\gt0$ there is $N$ such that $$|a_{m+1}+a_{m+2}+\cdots+a_n|\lt\varepsilon\qquad\text{for all }n\gt m\ge N .$$
  3. $n$-th term test. If $\sum a_n$ converges, then $a_n\to0$. Equivalently: if $a_n\not\to0$, the series diverges.
  4. Tails. Changing, adding or deleting finitely many terms does not affect convergence (it may change the sum). If $\sum a_n$ converges, its remainders satisfy $r_N\to0$.
  5. Grouping. If $\sum a_n=s$ and the terms are grouped into consecutive finite blocks without changing their order, the series of block sums also converges to $s$. Conversely, if the series of block sums converges to $s$, then $\sum a_n=s$ provided either $a_n\to0$ and the blocks have bounded length, or all terms inside each block have the same sign.

Proof. (1) The partial sums of $\sum(\alpha a_n+\beta b_n)$ are $\alpha s_n(a)+\beta s_n(b)$; apply the algebra of limits (§2.1, Theorem 2.2). (2) Since $s_n-s_m=a_{m+1}+\cdots+a_n$, this is exactly the statement that $(s_n)$ is a Cauchy sequence, and a real sequence converges if and only if it is Cauchy (§2.1, Theorem 2.8). (3) $a_n=s_n-s_{n-1}\to s-s=0$. (4) If two series differ in only the first $N$ terms, then for $n\ge N$ their partial sums differ by a fixed constant, so both converge or both diverge. And $r_N=s-s_N\to s-s=0$.

(5) If the blocks end at indices $n_1\lt n_2\lt\cdots$, the partial sums of the grouped series are $s_{n_1},s_{n_2},\dots$, which form a subsequence of $(s_n)$. If $s_n\to s$, the subsequence converges to $s$ (§2.2, Theorem 2.11). For the converse, suppose $s_{n_k}\to s$. Every $n\gt n_1$ satisfies $n_k\le n\lt n_{k+1}$ for exactly one $k$. If the blocks have length at most $L$, then $|s_n-s_{n_k}|\le L\max_{j\gt n_k}|a_j|$, and the right side tends to $0$ as $k\to\infty$ when $a_n\to0$. If the terms of each block have one sign, then $s_n$ lies between $s_{n_k}$ and $s_{n_{k+1}}$. In both cases $s_n\to s$. ∎

The converse in (5) really needs a hypothesis. The series $1-1+1-1+\cdots$ diverges, since its terms do not tend to $0$, yet the grouping $(1-1)+(1-1)+\cdots$ converges to $0$ and the grouping $1+(-1+1)+(-1+1)+\cdots$ converges to $1$. You may insert brackets into a convergent series, but you may not remove them freely.

📐 Theorem 2.22 — Geometric and telescoping series
(a) The geometric series $\sum_{n=0}^\infty r^n$ converges if and only if $|r|\lt1$, and then $$\sum_{n=0}^\infty r^n=\frac1{1-r}.$$ (b) A telescoping series $\sum_{n=1}^\infty(b_n-b_{n+1})$ converges if and only if $(b_n)$ converges, and then its sum is $b_1-\lim b_n$.

Proof. (a) For $r\ne1$, $s_n=1+r+\cdots+r^{n}=\dfrac{1-r^{n+1}}{1-r}$. If $|r|\lt1$, then $r^{n+1}\to0$ (§2.1, Theorem 2.5) and $s_n\to\frac1{1-r}$. If $|r|\ge1$, then $|r^n|\ge1$, so the terms do not tend to $0$ and the series diverges by Theorem 2.21(3). (b) The partial sums collapse: $s_n=(b_1-b_2)+\cdots+(b_n-b_{n+1})$ equals $b_1-b_{n+1}$. ∎

📐 Theorem 2.23 — Series of non-negative terms
If $a_n\ge0$ for all $n$, then $\sum a_n$ converges if and only if its partial sums are bounded. If they are unbounded, $\sum a_n$ diverges to $+\infty$. So a series of non-negative terms either converges or diverges to $+\infty$; it cannot oscillate.

Proof. $s_{n+1}-s_n=a_{n+1}\ge0$, so $(s_n)$ is increasing. By the monotone convergence theorem (§2.1, Theorem 2.6) it converges if it is bounded, and it tends to $+\infty$ if it is not. ∎

Almost every test below is a way of proving that partial sums are bounded without computing them. That is why the theory of series with non-negative terms comes first, and why the general case is then handled through absolute values.

✏️ Example 1 — Partial sums by hand
(a) Find $\displaystyle\sum_{n=1}^\infty\frac1{n(n+1)}$. (b) Find $\displaystyle\sum_{n=1}^\infty\frac{n}{2^n}$. (c) Show that $\sum\log\left(1+\frac1n\right)$ diverges although its terms tend to $0$. (d) Prove with the Cauchy criterion that the harmonic series $\sum\frac1n$ diverges.
(a) Telescoping $\dfrac1{n(n+1)}=\dfrac1n-\dfrac1{n+1}$, so by Theorem 2.22(b) with $b_n=\frac1n\to0$, $$s_N=1-\frac1{N+1}\to1 .$$ The sum is $1$.
(b) Shift and subtract Write $s_N=\sum_{n=1}^N\frac n{2^n}$. Then $$s_N-\tfrac12s_N=\sum_{n=1}^N\frac1{2^n}-\frac{N}{2^{N+1}}=1-\frac1{2^N}-\frac N{2^{N+1}} .$$ Hence $s_N=2-\dfrac{N+2}{2^N}$, and since $\frac{N}{2^N}\to0$ (§2.1, Theorem 2.5), $s_N\to2$. Check: $s_5=\frac12+\frac24+\frac38+\frac4{16}+\frac5{32}=\frac{57}{32}=2-\frac7{32}$ ✓.
(c) Terms → 0 is not enough $\log\left(1+\frac1n\right)=\log(n+1)-\log n\to0$, but the series telescopes to $s_N=\log(N+1)\to+\infty$.
(d) A block that never gets small For every $m$, $$s_{2m}-s_m=\frac1{m+1}+\cdots+\frac1{2m}\ge m\cdot\frac1{2m}=\frac12 .$$ So the Cauchy criterion fails for $\varepsilon=\frac12$ and the series diverges. Since its terms are positive, it diverges to $+\infty$ (Theorem 2.23). In fact $s_{2^k}\ge1+\frac k2$.

Comparison, Condensation and the Integral Test

For a series of non-negative terms, convergence means bounded partial sums, so it is enough to bound the terms by those of a series we already know converges. The two families we compare with are the geometric series and the $p$-series.

📐 Theorem 2.24 — Comparison and limit comparison tests
(a) Comparison test. Suppose $0\le a_n\le b_n$ for all $n\ge N$. If $\sum b_n$ converges, so does $\sum a_n$. If $\sum a_n$ diverges, so does $\sum b_n$.
(b) Limit comparison test. Let $a_n\ge0$, $b_n\gt0$ and $\dfrac{a_n}{b_n}\to L\in[0,\infty]$.
  • If $0\lt L\lt\infty$, then $\sum a_n$ and $\sum b_n$ both converge or both diverge.
  • If $L=0$ and $\sum b_n$ converges, then $\sum a_n$ converges.
  • If $L=\infty$ and $\sum b_n$ diverges, then $\sum a_n$ diverges.

Proof. (a) By Theorem 2.21(4) we may assume $N=1$. Then $s_n(a)\le s_n(b)\le\sum b_k$, so the partial sums of $\sum a_n$ are bounded and Theorem 2.23 applies. The second statement is the contrapositive of the first. (b) If $0\lt L\lt\infty$, then for $n$ large $\frac L2b_n\le a_n\le2Lb_n$, and (a) gives both directions. If $L=0$, then eventually $a_n\le b_n$. If $L=\infty$, then eventually $a_n\ge b_n$. ∎

The hypothesis $a_n\ge0$ cannot be dropped from (b). With $b_n=\frac{(-1)^n}{\sqrt n}$ and $a_n=\frac{(-1)^n}{\sqrt n}+\frac1n$ we have $a_n/b_n=1+\frac{(-1)^n}{\sqrt n}\to1$, but $\sum b_n$ converges (Leibniz test below) while $\sum a_n$ diverges (it is $\sum b_n$ plus the harmonic series).

📐 Theorem 2.25 — Cauchy condensation test
Let $(a_n)$ be decreasing with $a_n\ge0$. Then $$\sum_{n=1}^\infty a_n\ \text{converges}\iff\sum_{k=0}^\infty2^ka_{2^k}=a_1+2a_2+4a_4+8a_8+\cdots\ \text{converges}.$$

Proof. Group the terms in blocks of lengths $1,2,4,\dots$. The block $a_{2^j}+\cdots+a_{2^{j+1}-1}$ has $2^j$ terms, each at most $a_{2^j}$ because $(a_n)$ decreases. Hence $$s_{2^{k+1}-1}=\sum_{j=0}^{k}\big(a_{2^j}+\cdots+a_{2^{j+1}-1}\big)\le\sum_{j=0}^k2^ja_{2^j}.$$ Grouping instead as $a_1+a_2+(a_3+a_4)+(a_5+\cdots+a_8)+\cdots$, the block $a_{2^{j-1}+1}+\cdots+a_{2^j}$ has $2^{j-1}$ terms, each at least $a_{2^j}$, so $$s_{2^k}\ge a_1+\sum_{j=1}^k2^{j-1}a_{2^j}\ge\frac12\sum_{j=0}^k2^ja_{2^j}.$$ The first inequality shows that if the condensed series converges, the partial sums $s_n\le s_{2^{k+1}-1}$ are bounded. The second shows that if $\sum a_n$ converges, the partial sums of the condensed series are bounded by $2\sum a_n$. Theorem 2.23 finishes both directions. ∎

📐 Theorem 2.26 — The $p$-series and the logarithmic scale
(a) $\displaystyle\sum_{n=1}^\infty\frac1{n^p}$ converges if and only if $p\gt1$.
(b) $\displaystyle\sum_{n=2}^\infty\frac1{n(\log n)^p}$ converges if and only if $p\gt1$.
(c) $\displaystyle\sum_{n=3}^\infty\frac1{n\log n\,(\log\log n)^p}$ converges if and only if $p\gt1$.
In particular $\sum\frac1n$, $\sum\frac1{n\log n}$ and $\sum\frac1{n\log n\log\log n}$ all diverge, each more slowly than the one before.

Proof. (a) If $p\le0$, then $\frac1{n^p}\ge1$ and the terms do not tend to $0$. If $p\gt0$, the terms decrease, and the condensed series is $$\sum_k2^k\cdot2^{-kp}=\sum_k\big(2^{1-p}\big)^k,$$ a geometric series that converges if and only if $2^{1-p}\lt1$, that is, $p\gt1$ (Theorem 2.22(a)). (b) For $p\gt0$ the terms decrease, and $2^ka_{2^k}=\dfrac{2^k}{2^k(k\log2)^p}=\dfrac1{(\log2)^p}\cdot\dfrac1{k^p}$, so the condensed series is a constant times the $p$-series of (a). For $p\le0$ the terms are at least $\frac1n$ for $n\ge3$, so the series diverges. (c) Condensing once more turns (c) into a constant multiple of (b), up to finitely many terms. ∎

📐 Theorem 2.27 — Integral test; Euler's constant
Let $f:[1,\infty)\to[0,\infty)$ be decreasing (so it is Riemann integrable on every $[1,b]$, §4.1). Put $s_n=\sum_{k=1}^nf(k)$.
  1. $\sum f(n)$ converges if and only if the improper integral $\int_1^\infty f=\lim_{b\to\infty}\int_1^bf$ is finite (§4.2).
  2. $d_n=s_n-\int_1^nf$ is decreasing and $0\le d_n\le f(1)$, so $d_n$ converges to a limit in $[0,f(1)]$.
  3. If the series converges, its remainders satisfy $$\int_{N+1}^\infty f\le\sum_{n=N+1}^\infty f(n)\le\int_N^\infty f .$$
For $f(x)=\frac1x$, (2) says that $H_n-\log n$ decreases to a limit $\gamma\approx0.5772$, Euler's constant, where $H_n=1+\frac12+\cdots+\frac1n$.

Proof. For $k\le x\le k+1$ we have $f(k+1)\le f(x)\le f(k)$. Integrating over $[k,k+1]$ gives $$f(k+1)\le\int_k^{k+1}f\le f(k).$$ Summing over $k=1,\dots,n-1$ gives $s_n-f(1)\le\int_1^nf\le s_{n-1}$. (1) If the integral is finite, $s_n\le f(1)+\int_1^\infty f$ is bounded. If it is infinite, $s_{n-1}\ge\int_1^nf\to\infty$. (2) Since $d_n-d_{n+1}=\int_n^{n+1}f-f(n+1)\ge0$, the sequence decreases. Also $d_n=f(n)+\sum_{k=1}^{n-1}\big(f(k)-\int_k^{k+1}f\big)\ge f(n)\ge0$, and $d_1=f(1)$. (3) Summing $f(k+1)\le\int_k^{k+1}f\le f(k)$ over $k\ge N$ gives $\sum_{n\gt N}f(n)\le\int_N^\infty f$. Summing over $k\ge N+1$ gives $\int_{N+1}^\infty f\le\sum_{n\gt N}f(n)$. ∎

✏️ Example 2 — Comparison at work
Decide whether each series converges: (a) $\displaystyle\sum\frac1{n^2-n+1}$; (b) $\displaystyle\sum\sin\frac1n$; (c) $\displaystyle\sum\Big(1-\cos\frac1n\Big)$; (d) $\displaystyle\sum\big(n^{1/n}-1\big)$; (e) $\displaystyle\sum\frac1{n^{1+1/n}}$; (f) $\displaystyle\sum_{n\ge2}\frac1{(\log n)^{\log n}}$.
(a) Converges $\dfrac{1/(n^2-n+1)}{1/n^2}=\dfrac{n^2}{n^2-n+1}\to1$, and $\sum\frac1{n^2}$ converges. Apply the limit comparison test.
(b) Diverges $\sin\frac1n\gt0$ and $\dfrac{\sin(1/n)}{1/n}\to1$ (since $\frac{\sin x}x\to1$ as $x\to0$). Limit comparison with the harmonic series.
(c) Converges $1-\cos\frac1n=2\sin^2\frac1{2n}\le2\cdot\frac1{4n^2}=\frac1{2n^2}$, using $|\sin x|\le|x|$. Apply the comparison test with $\sum\frac1{2n^2}$.
(d) Diverges $n^{1/n}-1=e^{(\log n)/n}-1\ge\frac{\log n}n\ge\frac1n$ for $n\ge3$, because $e^t-1\ge t$. Apply the comparison test with the harmonic series.
(e) Diverges — a trap Every exponent $1+\frac1n$ exceeds $1$, yet $\dfrac{1/n^{1+1/n}}{1/n}=\dfrac1{n^{1/n}}\to1$ (§2.1, Theorem 2.5). By limit comparison with $\sum\frac1n$ the series diverges. The $p$-test needs one fixed $p\gt1$. An exponent that creeps down to $1$ is not enough.
(f) Converges $(\log n)^{\log n}=e^{\log n\cdot\log\log n}=n^{\log\log n}$. For $n\ge e^{e^2}\approx1618.2$ we have $\log\log n\ge2$, so the terms are at most $\frac1{n^2}$. Compare with $\sum\frac1{n^2}$. (Compare Exercise II.6, where a slightly smaller exponent gives divergence.)
✏️ Example 3 — Condensation and the integral test in action
(a) Show that $\sum_{n\ge2}\frac1{n\log n}$ diverges, and explain why numerical summation cannot reveal this. (b) How many terms of $\sum\frac1{n^2}$ guarantee an error below $10^{-3}$? (c) Show that $\log(n+1)\le H_n\le1+\log n$, and estimate how many terms of the harmonic series are needed for the partial sum to exceed $20$.
(a) Condense The terms decrease, and $2^k\cdot\dfrac1{2^k\log2^k}=\dfrac1{k\log2}$, a multiple of the harmonic series. So the series diverges (Theorem 2.26(b) with $p=1$). By the integral test with $f(x)=\frac1{x\log x}$, whose antiderivative is $\log\log x$, the partial sums grow like $\log\log N$. Summing a million terms gives only $3.42$, and $10^{100}$ terms would give about $6.2$. No computer can distinguish this from convergence.
(b) Remainder bounds With $f(x)=\frac1{x^2}$, Theorem 2.27(3) gives $\frac1{N+1}\le r_N\le\frac1N$, and both inequalities are strict because $f$ is strictly decreasing. For $N=1000$: $r_N\lt10^{-3}$. For $N=999$: $r_N\gt\frac1{1000}$. So exactly $N=1000$ terms are needed. (Numerically $r_{1000}=0.0009995$ and $r_{999}=0.0010005$.) The ratio test would never give such a precise count.
(c) Harmonic numbers From the proof of Theorem 2.27 with $f=\frac1x$: $\int_1^{n+1}\frac{dx}x\le H_n\le1+\int_1^n\frac{dx}x$, which is the claim. Since $H_n=\log n+\gamma+o(1)$ by (2), $H_n\gt20$ needs roughly $n\approx e^{20-\gamma}\approx2.7\times10^8$. The exact threshold is $n=272\,400\,600$.
Lesson Divergence can be extraordinarily slow. Only a proof decides convergence; numerics can at best estimate a sum that is already known to exist.

The Root, Ratio and Raabe Tests

The root and ratio tests compare a series with a geometric series. The root test uses $\limsup$ (§2.2), so it never needs a limit to exist.

📐 Theorem 2.28 — Root test (Cauchy)
Let $\rho=\limsup_{n\to\infty}|a_n|^{1/n}\in[0,\infty]$.
  • If $\rho\lt1$, then $\sum a_n$ converges absolutely (that is, $\sum|a_n|$ converges).
  • If $\rho\gt1$, then $|a_n|\gt1$ for infinitely many $n$, so $a_n\not\to0$ and $\sum a_n$ diverges.
  • If $\rho=1$, no conclusion is possible: $\sum\frac1n$ diverges and $\sum\frac1{n^2}$ converges, and both have $\rho=1$.

Proof. If $\rho\lt1$, fix $r$ with $\rho\lt r\lt1$. By Theorem 2.15(2) of §2.2, $|a_n|^{1/n}\lt r$ for all large $n$, so $|a_n|\lt r^n$ eventually. Compare with the geometric series $\sum r^n$. If $\rho\gt1$, then $|a_n|^{1/n}\gt1$ for infinitely many $n$ (again Theorem 2.15(2), or directly from the definition when $\rho=+\infty$), so infinitely many terms satisfy $|a_n|\gt1$. Finally $n^{-1/n}\to1$ and $n^{-2/n}\to1$, which gives the two examples. ∎

📐 Theorem 2.29 — Ratio test (d'Alembert)
Let $a_n\ne0$ for all $n$.
  • If $\limsup\left|\dfrac{a_{n+1}}{a_n}\right|\lt1$, then $\sum a_n$ converges absolutely.
  • If $\left|\dfrac{a_{n+1}}{a_n}\right|\ge1$ for all $n\ge N$ (in particular, if $\liminf\left|\dfrac{a_{n+1}}{a_n}\right|\gt1$), then $\sum a_n$ diverges.
  • Otherwise ($\liminf\le1\le\limsup$) no conclusion is possible. In particular $\limsup\left|\frac{a_{n+1}}{a_n}\right|\gt1$ does not imply divergence.

Proof. If $\limsup|a_{n+1}/a_n|\lt1$, then $\limsup|a_n|^{1/n}\lt1$ by the chain of inequalities in Theorem 2.18 (§2.2), and the root test applies. (Directly: for $r$ strictly between the $\limsup$ and $1$, $|a_n|\le|a_N|r^{n-N}$ for $n\ge N$.) If $|a_{n+1}|\ge|a_n|$ for $n\ge N$, then $|a_n|\ge|a_N|\gt0$ for all $n\ge N$, so $a_n\not\to0$. Example 4(d) below shows the last claim. ∎

By Theorem 2.18, $\liminf\frac{|a_{n+1}|}{|a_n|}\le\liminf|a_n|^{1/n}$ and $\limsup|a_n|^{1/n}\le\limsup\frac{|a_{n+1}|}{|a_n|}$. Hence whenever the ratio test decides, the root test decides too, and the root test sometimes decides when the ratio test cannot. The ratio test is often easier to compute, especially with factorials. Both fail for every series whose terms decay like a power of $n$, because then both limits equal $1$. For these, Raabe's test measures the ratio more finely.

📐 Theorem 2.30 — Raabe's test
Let $a_n\gt0$ and $R_n=n\left(\dfrac{a_n}{a_{n+1}}-1\right)$.
  • If there are $r\gt1$ and $N$ with $R_n\ge r$ for all $n\ge N$, then $\sum a_n$ converges.
  • If $R_n\le1$ for all $n\ge N$, then $\sum a_n$ diverges.
In particular, if $R_n\to R$, the series converges for $R\gt1$ and diverges for $R\lt1$. For $R=1$ no conclusion is possible.

Proof. Suppose $R_n\ge r\gt1$ for $n\ge N$. Then $na_n-na_{n+1}\ge ra_{n+1}$, that is, $$na_n-(n+1)a_{n+1}\ge(r-1)a_{n+1}\gt0\qquad(n\ge N).$$ Summing from $n=N$ to $m-1$, the left side telescopes: $(r-1)\sum_{n=N+1}^{m}a_n\le Na_N-ma_m\le Na_N$. The partial sums are bounded, so the series converges (Theorem 2.23). Now suppose $R_n\le1$ for $n\ge N$. Then $na_n-na_{n+1}\le a_{n+1}$, so $na_n\le(n+1)a_{n+1}$. The sequence $(na_n)_{n\ge N}$ is increasing, so $a_n\ge\frac cn$ with $c=Na_N\gt0$, and the series diverges by comparison with the harmonic series. For $R=1$: both $\frac1{n\log n}$ (divergent) and $\frac1{n(\log n)^2}$ (convergent) have $R_n\to1$. ∎

A sharper version, Gauss's test, says: if $\dfrac{a_n}{a_{n+1}}=1+\dfrac\mu n+O\!\left(\dfrac1{n^2}\right)$, then $\sum a_n$ converges if and only if $\mu\gt1$ (statement only). The case $\mu=1$ diverges.

🧭 Problem-solving strategy — choosing a test
  1. Do the terms tend to $0$? If not, the series diverges, and you are finished.
  2. Non-negative terms built from powers, roots and logarithms: find the dominant behaviour $a_n\approx\frac{C}{n^p(\log n)^q}$ and use limit comparison with the $p$- and log-scale of Theorem 2.26. Taylor expansions ($\sin\frac1n$, $1-\cos\frac1n$, $e^{1/n}-1$, $n^{1/n}-1$) are the usual source of the dominant term.
  3. Factorials, $n$-th powers, $c^n$: ratio test for products and factorials, root test for expressions raised to the power $n$ or $n^2$. If the limit is $1$, switch to Raabe's test or to Stirling-type estimates.
  4. Decreasing positive terms with logarithms: condensation or the integral test.
  5. Signs that change: first test absolute convergence. If that fails, try Leibniz (alternating, decreasing to $0$), then Dirichlet (bounded partial sums of the oscillating factor times a monotone null factor), then Abel. If none applies, split the term into a convergent part plus a remainder (Example 5(c)).
  6. Depends on a parameter $x$ or $p$: find the critical value with the ratio or root test, then examine the boundary values separately. They almost always need a different test.
✏️ Example 4 — Root, ratio and Raabe
Decide convergence: (a) $\displaystyle\sum\frac{n!}{n^n}$; (b) $\displaystyle\sum\Big(\frac{n}{n+1}\Big)^{n^2}$; (c) $\displaystyle\sum\frac{2^n+5^n}{3^n+4^n}$; (d) $\sum a_n$ with $a_n=2^{-n}$ for odd $n$ and $a_n=3^{-n}$ for even $n$; (e) $\displaystyle\sum\left(\frac{1\cdot3\cdot5\cdots(2n-1)}{2\cdot4\cdot6\cdots(2n)}\right)^p$ for $p\gt0$.
(a) Ratio $\dfrac{a_{n+1}}{a_n}=\dfrac{(n+1)!\,n^n}{(n+1)^{n+1}n!}=\Big(\dfrac{n}{n+1}\Big)^n=\dfrac1{(1+1/n)^n}\to\dfrac1e\lt1$: converges.
(b) Root $a_n^{1/n}=\Big(\dfrac n{n+1}\Big)^n\to\dfrac1e\lt1$: converges. (The ratio test leads to a messy limit. A power $n^2$ calls for the root test.)
(c) Root $(2^n+5^n)^{1/n}\to5$ and $(3^n+4^n)^{1/n}\to4$ (the dominant term, §2.1). So $a_n^{1/n}\to\frac54\gt1$ and the series diverges. Indeed $a_n\ge\frac{5^n}{2\cdot4^n}\to\infty$.
(d) Ratio fails, root succeeds For odd $n$: $\dfrac{a_{n+1}}{a_n}=\dfrac{2^n}{3^{n+1}}\to0$. For even $n$: $\dfrac{a_{n+1}}{a_n}=\dfrac{3^n}{2^{n+1}}\to\infty$. So $\liminf=0$ and $\limsup=\infty$, and the ratio test is silent even though $\limsup\gt1$. The roots are $\frac12$ (odd $n$) and $\frac13$ (even $n$), so $\limsup a_n^{1/n}=\frac12\lt1$: converges. Its sum is $\sum_{n\text{ odd}}2^{-n}+\sum_{n\text{ even}}3^{-n}=\frac23+\frac18=\frac{19}{24}$.
(e) Raabe Here $\dfrac{a_n}{a_{n+1}}=\Big(\dfrac{2n+2}{2n+1}\Big)^p=\Big(1+\dfrac1{2n+1}\Big)^p$, so the ratio tends to $1$ and the ratio test fails. Since $(1+t)^p-1\sim pt$ as $t\to0$, $$R_n=n\left[\Big(1+\frac1{2n+1}\Big)^p-1\right]\to\frac p2 .$$ So the series converges for $p\gt2$ and diverges for $p\lt2$.
(e) The boundary $p=2$ Let $P_n=\frac12\cdot\frac34\cdots\frac{2n-1}{2n}$. Since $(2k-1)^2\ge(2k-2)\,2k$, we have $\frac{2k-1}{2k}\ge\frac{2k-2}{2k-1}$. Therefore $$P_n^2\ge\frac14\prod_{k=2}^n\frac{2k-1}{2k}\cdot\frac{2k-2}{2k-1}=\frac14\prod_{k=2}^n\frac{k-1}k=\frac1{4n}.$$ So $\sum P_n^2$ diverges by comparison with $\sum\frac1{4n}$. (Gauss's test agrees: $\mu=1$. In fact $P_n\sim\frac1{\sqrt{\pi n}}$.) Answer: convergence if and only if $p\gt2$.
Interactive 1 — Ratio and Root Tests Side by Side

For $n=1,\dots,60$ the red dots are the ratios $a_{n+1}/a_n$ and the blue squares are the roots $a_n^{1/n}$. The amber line is the threshold $1$, and the dashed purple line is $\limsup a_n^{1/n}$. Values above $2$ are shown as ▲ on the top edge. Watch which sequence settles below $1$, which oscillates, and which creeps up to $1$ and leaves both tests silent.

n—
aₙ₊₁/aₙ—
aₙ^(1/n)—
ratio test—
root test—
the truth—

Absolute and Conditional Convergence; Alternating Series; Dirichlet and Abel

📘 Definition 2.11 — Absolute and conditional convergence
A series $\sum a_n$ converges absolutely if $\sum|a_n|$ converges. It converges conditionally if $\sum a_n$ converges but $\sum|a_n|$ diverges. For a real number $a$ write $a^+=\max(a,0)$ and $a^-=\max(-a,0)$. Then $a=a^+-a^-$ and $|a|=a^++a^-$.
📐 Theorem 2.31 — Absolute convergence implies convergence
(a) If $\sum|a_n|$ converges, then $\sum a_n$ converges and $\left|\sum a_n\right|\le\sum|a_n|$.
(b) $\sum a_n$ converges absolutely if and only if both $\sum a_n^+$ and $\sum a_n^-$ converge, and then $\sum a_n=\sum a_n^+-\sum a_n^-$.
(c) If $\sum a_n$ converges conditionally, then $\sum a_n^+=\sum a_n^-=+\infty$: the positive terms alone and the negative terms alone both diverge.

Proof. (a) By the triangle inequality, $|a_{m+1}+\cdots+a_n|$ is at most $|a_{m+1}|+\cdots+|a_n|$. The right side is small for large $m$ by the Cauchy criterion for $\sum|a_n|$, so the left side is too, and $\sum a_n$ satisfies the Cauchy criterion (Theorem 2.21(2)). Letting $n\to\infty$ in $|s_n|\le\sum_{k\le n}|a_k|$ gives the inequality. (b) If $\sum|a_n|$ converges, the comparisons $0\le a_n^\pm\le|a_n|$ give convergence of both parts. Conversely $|a_n|=a_n^++a_n^-$, and linearity applies. (c) If $\sum a_n^+$ converged, then $\sum a_n^-=\sum(a_n^+-a_n)$ would converge by linearity, and by (b) $\sum a_n$ would converge absolutely. The same argument works with $+$ and $-$ exchanged. Both series have non-negative terms, so they diverge to $+\infty$ (Theorem 2.23). ∎

📐 Theorem 2.32 — Alternating series test (Leibniz)
Let $(a_n)$ be decreasing with $a_n\to0$ (so $a_n\ge0$). Then $\sum_{n=1}^\infty(-1)^{n+1}a_n=a_1-a_2+a_3-\cdots$ converges to some $s$. Moreover $s_{2n}\uparrow s$, $s_{2n-1}\downarrow s$, and $$|s-s_n|\le a_{n+1}\qquad\text{for every }n .$$ So the error after $n$ terms is at most the first omitted term, and it has the same sign as that term.

Proof. Since $s_{2n+2}-s_{2n}=a_{2n+1}-a_{2n+2}\ge0$ and $s_{2n+1}-s_{2n-1}=-a_{2n}+a_{2n+1}\le0$, the even partial sums increase and the odd ones decrease. Also $s_{2n+1}-s_{2n}=a_{2n+1}\ge0$, so $$s_2\le s_4\le\cdots\le s_{2n}\le s_{2n+1}\le\cdots\le s_3\le s_1 .$$ Both monotone sequences are bounded, so they converge (§2.1, Theorem 2.6). Their difference $a_{2n+1}$ tends to $0$, so they have the same limit $s$, and $s_n\to s$ (§2.2, Theorem 2.11(d)). From the display, $s$ lies between $s_n$ and $s_{n+1}$ for every $n$. Hence $|s-s_n|\le|s_{n+1}-s_n|=a_{n+1}$, and $s-s_n$ has the sign of $s_{n+1}-s_n=(-1)^na_{n+1}$. ∎

So $1-\frac12+\frac13-\cdots$ converges (to $\log2$, Exercise III.7) but not absolutely. Leibniz's test is the special case $a_n=(-1)^{n+1}$ of a more flexible principle: bounded partial sums times a monotone null sequence. The tool behind it is a discrete form of integration by parts.

📐 Theorem 2.33 — Abel's summation by parts
Let $A_n=a_1+\cdots+a_n$ and $A_0=0$. For $1\le m\le n$, $$\sum_{k=m}^na_kb_k=A_nb_n-A_{m-1}b_m+\sum_{k=m}^{n-1}A_k\,(b_k-b_{k+1}) .$$

Proof. Substitute $a_k=A_k-A_{k-1}$ and shift the index in the second sum: $$\sum_{k=m}^n(A_k-A_{k-1})b_k=\sum_{k=m}^nA_kb_k-\sum_{k=m-1}^{n-1}A_kb_{k+1}.$$ Separating the term $k=n$ from the first sum and the term $k=m-1$ from the second leaves $A_nb_n-A_{m-1}b_m+\sum_{k=m}^{n-1}A_k(b_k-b_{k+1})$. ∎

📐 Theorem 2.34 — Dirichlet's test and Abel's test
(a) Dirichlet's test. If the partial sums $A_n$ of $\sum a_n$ are bounded, say $|A_n|\le M$ for all $n$, and $(b_n)$ is monotone with $b_n\to0$, then $\sum a_nb_n$ converges.
(b) Abel's test. If $\sum a_n$ converges and $(b_n)$ is monotone and bounded, then $\sum a_nb_n$ converges.
Leibniz's test is (a) with $a_n=(-1)^{n+1}$, whose partial sums are $1,0,1,0,\dots$

Proof. (a) Since $(b_n)$ is monotone with limit $0$, $(|b_n|)$ decreases and the differences $b_k-b_{k+1}$ all have the same sign. So $\sum_{k=m}^{n-1}|b_k-b_{k+1}|=|b_m-b_n|$. By Theorem 2.33, $$\Big|\sum_{k=m}^na_kb_k\Big|\le M|b_n|+M|b_m|+M|b_m-b_n|\le4M|b_m| .$$ The right side tends to $0$ as $m\to\infty$, so the Cauchy criterion holds. (b) $(b_n)$ converges to some $b$ by the monotone convergence theorem, and $b_n-b$ is monotone with limit $0$. The partial sums of the convergent series $\sum a_n$ are bounded, so $\sum a_n(b_n-b)$ converges by (a). Then $\sum a_nb_n=\sum a_n(b_n-b)+b\sum a_n$ converges by linearity. ∎

The standard application uses the two trigonometric sums. For $x\notin2\pi\mathbb{Z}$, the product formulas $2\sin\frac x2\sin kx=\cos(k-\frac12)x-\cos(k+\frac12)x$ and $2\sin\frac x2\cos kx=\sin(k+\frac12)x-\sin(k-\frac12)x$ make the sums telescope: $$\Big|\sum_{k=1}^n\sin kx\Big|\le\frac1{|\sin(x/2)|},\qquad\Big|\sum_{k=1}^n\cos kx\Big|\le\frac1{|\sin(x/2)|}.$$

✏️ Example 5 — Alternating series and Dirichlet's test
(a) Classify $\sum\frac{(-1)^{n+1}}{n^p}$ for all real $p$. (b) Show that $\sum\frac{\sin nx}n$ converges for every real $x$, but converges absolutely only when $x\in\pi\mathbb{Z}$. (c) Show that $\sum_{n\ge2}\frac{(-1)^n}{\sqrt n+(-1)^n}$ diverges, although it alternates and its terms tend to $0$. (d) Show that $\sum\frac{(-1)^n}n\left(1+\frac1n\right)^n$ converges.
(a) Three regimes $p\gt1$: converges absolutely ($p$-series). $0\lt p\le1$: $\frac1{n^p}$ decreases to $0$, so the series converges by Leibniz, but not absolutely, so it converges conditionally. $p\le0$: the terms do not tend to $0$, so it diverges.
(b) Dirichlet If $x\in2\pi\mathbb{Z}$, every term is $0$. Otherwise the partial sums of $\sum\sin nx$ are bounded by $\frac1{|\sin(x/2)|}$ and $\frac1n\downarrow0$, so Dirichlet's test applies. For absolute convergence: if $x\in\pi\mathbb{Z}$ all terms vanish. Otherwise $|\sin nx|\ge\sin^2nx=\frac{1-\cos2nx}2$. Here $\sum\frac{\cos2nx}{2n}$ converges by Dirichlet (since $2x\notin2\pi\mathbb{Z}$) and $\sum\frac1{2n}$ diverges, so $\sum\frac{|\sin nx|}n$ diverges. (Fourier analysis gives the sum $\frac{\pi-x}2$ for $0\lt x\lt2\pi$.)
(c) Leibniz needs monotonicity Multiply by the conjugate: $$\frac{(-1)^n}{\sqrt n+(-1)^n}=\frac{(-1)^n(\sqrt n-(-1)^n)}{n-1}=\frac{(-1)^n\sqrt n}{n-1}-\frac1{n-1}.$$ The first part converges by Leibniz, because $\frac{\sqrt x}{x-1}$ has derivative $-\frac{x+1}{2\sqrt x(x-1)^2}\lt0$. The second part is a harmonic series. A convergent series plus a divergent one diverges, so the series diverges (to $-\infty$). The absolute values $\frac1{\sqrt n\pm1}$ are not monotone, so Leibniz's test was never applicable.
(d) Abel $\sum\frac{(-1)^n}n$ converges and $b_n=\left(1+\frac1n\right)^n$ is increasing and bounded by $e$ (§2.1, Theorem 2.7). Apply Abel's test.
✏️ Example 6 — Prove or disprove
(a) If $\sum a_n$ converges, then $\sum a_n^2$ converges. (b) If $\sum a_n$ converges absolutely, then $\sum a_n^2$ converges. (c) If $a_n\ge0$ and $\sum a_n$ converges, then $\sum\frac{\sqrt{a_n}}n$ converges. (d) If $\sum a_n$ converges and $b_n\to1$, then $\sum a_nb_n$ converges. (e) If $(a_n)$ is decreasing, $a_n\ge0$ and $\sum a_n$ converges, then $na_n\to0$; and the same holds without monotonicity.
(a) False $a_n=\frac{(-1)^n}{\sqrt n}$: $\sum a_n$ converges (Leibniz), but $\sum a_n^2=\sum\frac1n$ diverges.
(b) True $|a_n|\to0$, so $|a_n|\le1$ for large $n$, and then $a_n^2\le|a_n|$. Apply the comparison test.
(c) True By the AM–GM inequality, $\frac{\sqrt{a_n}}n\le\frac12\left(a_n+\frac1{n^2}\right)$, and the right side is the general term of a convergent series. (Alternatively, use the Cauchy–Schwarz inequality.)
(d) False Take $a_n=\frac{(-1)^n}{\sqrt n}$ and $b_n=1+\frac{(-1)^n}{\sqrt n}\to1$. Then $a_nb_n=\frac{(-1)^n}{\sqrt n}+\frac1n$, and $\sum a_nb_n$ diverges. The statement becomes true if $\sum a_n$ converges absolutely and $(b_n)$ is bounded, or if $(b_n)$ is monotone (Abel).
(e) True with monotonicity By the Cauchy criterion, $s_{2n}-s_n=a_{n+1}+\cdots+a_{2n}\to0$, and since the terms decrease, $s_{2n}-s_n\ge na_{2n}$. So $2na_{2n}\to0$. Also $(2n+1)a_{2n+1}\le\frac{2n+1}{2n}\cdot2na_{2n}\to0$. Both subsequences tend to $0$, so $na_n\to0$ (§2.2, Theorem 2.11(d)). Without monotonicity it fails: let $a_n=\frac1n$ when $n$ is a perfect square and $a_n=\frac1{n^2}$ otherwise. Then $\sum a_n\le\sum\frac1{k^2}+\sum\frac1{n^2}$ converges, but $na_n=1$ for every square $n$. The converse also fails, even for decreasing terms: $\frac1{n\log n}$ has $na_n\to0$, yet $\sum\frac1{n\log n}$ diverges.

Rearrangements and Products of Series

Finite sums can be added in any order and multiplied term by term. For infinite series both operations are a genuine issue, and the answer depends on whether the convergence is absolute.

📘 Definition 2.12 — Rearrangement
If $\sigma:\mathbb{N}\to\mathbb{N}$ is a bijection, the series $\sum_{k=1}^\infty a_{\sigma(k)}$ is a rearrangement of $\sum a_n$. It contains every term exactly once, in a different order. (Grouping, as in Theorem 2.21(5), keeps the order; rearranging changes it.)
📐 Theorem 2.35 — Rearranging an absolutely convergent series (Dirichlet)
If $\sum a_n$ converges absolutely with sum $s$, then every rearrangement $\sum a_{\sigma(k)}$ converges absolutely, and its sum is also $s$. For series of non-negative terms, every rearrangement has the same sum, finite or $+\infty$.

Proof. Let $t_k=a_{\sigma(1)}+\cdots+a_{\sigma(k)}$ and $\varepsilon\gt0$. Choose $N$ with $\sum_{n\gt N}|a_n|\lt\varepsilon$ (Theorem 2.21(4)), so that also $|s-s_N|\lt\varepsilon$. Since $\sigma$ is onto, there is $K$ such that $\{\sigma(1),\dots,\sigma(K)\}\supseteq\{1,\dots,N\}$. For $k\ge K$, the difference $t_k-s_N$ is a finite sum of terms $a_n$ with distinct indices $n\gt N$, so $|t_k-s_N|\le\sum_{n\gt N}|a_n|\lt\varepsilon$. Hence $|t_k-s|\lt2\varepsilon$ for all $k\ge K$, and $t_k\to s$. Applying the same argument to $\sum|a_n|$ shows that the rearrangement converges absolutely. For non-negative terms, every partial sum of either series is at most the sum of the other, so the two sums coincide. ∎

📐 Theorem 2.36 — Riemann rearrangement theorem
Let $\sum a_n$ converge conditionally. For every $s\in\mathbb{R}$ there is a rearrangement converging to $s$. There are also rearrangements diverging to $+\infty$ and to $-\infty$. More generally, for any $-\infty\le\alpha\le\beta\le+\infty$ there is a rearrangement whose partial sums $t_k$ satisfy $\liminf t_k=\alpha$ and $\limsup t_k=\beta$. Combined with Theorem 2.35: a convergent series has the same sum in every order if and only if it converges absolutely.

Proof sketch. Let $p_1,p_2,\dots$ be the positive terms of $\sum a_n$ and $-q_1,-q_2,\dots$ the negative terms, each list in its original order. Zero terms can be slotted in anywhere without effect. Step 1: by Theorem 2.31(c), $\sum p_i=\sum q_j=+\infty$. Step 2: $p_i\to0$ and $q_j\to0$, because $a_n\to0$. Step 3 (greedy construction for real $s$): take $p_1,p_2,\dots$ until the running sum first exceeds $s$. Then take $-q_1,-q_2,\dots$ until it first drops below $s$. Then go back to the unused $p$'s, and so on. Each stage ends after finitely many terms by Step 1, and every stage uses at least one new term, so every term is eventually used and we have a genuine rearrangement. Step 4: after the first stage, the distance from the running sum to $s$ never exceeds the last term at which the direction switched, and these terms tend to $0$ by Step 2. So $t_k\to s$. For $+\infty$, use targets $1,2,3,\dots$, taking one negative term after each target is passed. For general $\alpha\lt\beta$, alternate between real targets $\alpha_k\to\alpha$ and $\beta_k\to\beta$. ∎

Interactive 2 — Rearranging 1 − ½ + ⅓ − ¼ + ⋯ to Hit Any Target

The faint blue curve shows the partial sums in the original order, which converge to $\log2\approx0.693$. The red curve uses the same terms, rearranged by the greedy rule of Theorem 2.36: add unused positive terms $1,\frac13,\frac15,\dots$ while the sum is $\le T$, otherwise add unused negative terms $-\frac12,-\frac14,\dots$. Move the target $T$ and watch the overshoots shrink. The readouts compare the ratio of positive to negative terms used with the value predicted in Example 7.

1.5
terms used k—
positives p / negatives q—
rearranged sum—
original order—
p/q now—
predicted e^(2(T − log 2))—
📘 Definition 2.13 — Cauchy product
The Cauchy product of $\sum_{n=0}^\infty a_n$ and $\sum_{n=0}^\infty b_n$ is the series $\sum_{n=0}^\infty c_n$ with $$c_n=\sum_{k=0}^na_kb_{n-k}=a_0b_n+a_1b_{n-1}+\cdots+a_nb_0 .$$ It collects the products $a_kb_j$ along the diagonals $k+j=n$, exactly as when multiplying power series: $\left(\sum a_nx^n\right)\left(\sum b_nx^n\right)=\sum c_nx^n$.
📐 Theorem 2.37 — Products of series (Mertens, Cauchy, Abel)
Let $\sum a_n=A$ and $\sum b_n=B$ (indices from $0$), and let $\sum c_n$ be their Cauchy product.
(a) Mertens' theorem. If at least one of the two series converges absolutely, then $\sum c_n$ converges and $\sum c_n=AB$.
(b) Cauchy. If both converge absolutely, so does $\sum c_n$.
(c) Abel (statement only; proof via Abel's theorem on power series, §5.2). If $\sum c_n$ converges at all, its sum is $AB$.
Without absolute convergence of one factor, $\sum c_n$ may diverge (Example 7(c)).

Proof. (a) Say $\sum|a_n|=\alpha\lt\infty$. Write $A_N,B_N,C_N$ for the partial sums up to index $N$. Collecting the products $a_kb_j$ with $k+j\le N$ by the index $k$ gives $$C_N=\sum_{k=0}^Na_kB_{N-k}=A_NB+\sum_{k=0}^Na_k\beta_{N-k},\qquad\beta_m=B_m-B\to0 .$$ It suffices to show $\gamma_N=\sum_{k=0}^Na_k\beta_{N-k}\to0$. Let $|\beta_m|\le M$ for all $m$ (a convergent sequence is bounded) and $\varepsilon\gt0$, and choose $N_0$ with $|\beta_m|\lt\varepsilon$ for $m\ge N_0$. For $N\gt N_0$, split according to whether $N-k\ge N_0$: $$|\gamma_N|\le\varepsilon\sum_{k=0}^{N-N_0}|a_k|+M\sum_{k=N-N_0+1}^{N}|a_k|\le\varepsilon\alpha+M\sum_{k\gt N-N_0}|a_k| .$$ As $N\to\infty$ the last sum is a tail of a convergent series and tends to $0$. So $\limsup|\gamma_N|\le\varepsilon\alpha$ for every $\varepsilon$, hence $\gamma_N\to0$ and $C_N\to AB$. (b) $\sum_{n\le N}|c_n|\le\sum_{k+j\le N}|a_k||b_j|$, and this is at most $\Big(\sum_{k\le N}|a_k|\Big)\Big(\sum_{j\le N}|b_j|\Big)$, because the triangle $k+j\le N$ lies inside the square $k,j\le N$. The partial sums are bounded, so $\sum|c_n|$ converges. ∎

✏️ Example 7 — Rearranging and multiplying
(a) Rearrange $1-\frac12+\frac13-\cdots$ by taking $p$ positive terms, then $q$ negative terms, repeatedly, each kind in its original order. Show that the sum becomes $\log2+\frac12\log\frac pq$. In particular $1+\frac13-\frac12+\frac15+\frac17-\frac14+\cdots=\frac32\log2$. (b) Show directly that $1-\frac12-\frac14+\frac13-\frac16-\frac18+\frac15-\cdots=\frac12\log2$. (c) Show that the Cauchy product of $\sum_{n\ge0}\frac{(-1)^n}{\sqrt{n+1}}$ with itself diverges. (d) Show that $\left(\sum_{n\ge0}x^n\right)^2=\sum_{n\ge0}(n+1)x^n=\frac1{(1-x)^2}$ for $|x|\lt1$.
(a) Count with $H_n$ After $m$ blocks we have used the first $pm$ odd reciprocals and the first $qm$ even ones: $$T_m=\Big(H_{2pm}-\tfrac12H_{pm}\Big)-\tfrac12H_{qm},$$ since $1+\frac13+\cdots+\frac1{2r-1}=H_{2r}-\frac12H_r$ and $\frac12+\cdots+\frac1{2r}=\frac12H_r$. With $H_n=\log n+\gamma+\varepsilon_n$ and $\varepsilon_n\to0$ (Theorem 2.27), the $\gamma$'s cancel and $$T_m=\log(2pm)-\tfrac12\log(pm)-\tfrac12\log(qm)+o(1)\to\log2+\tfrac12\log\tfrac pq .$$ The terms tend to $0$ and the blocks have bounded length $p+q$, so the whole rearranged series converges to the same value (Theorem 2.21(5)). For $p=2$, $q=1$: $\log2+\frac12\log2=\frac32\log2\approx1.0397$.
(b) Group The pattern is one positive, two negatives ($p=1$, $q=2$). Group as $\left(1-\frac12\right)-\frac14+\left(\frac13-\frac16\right)-\frac18+\cdots$. This gives $\frac12-\frac14+\frac16-\frac18+\cdots=\frac12\left(1-\frac12+\frac13-\cdots\right)=\frac12\log2$. Removing the brackets is allowed, by Theorem 2.21(5), because the terms tend to $0$ and the groups have length at most $2$. This agrees with (a): $\log2+\frac12\log\frac12=\frac12\log2$. The same terms, in a different order, now add up to half as much.
(c) A divergent product $c_n=(-1)^n\sum_{k=0}^n\dfrac1{\sqrt{(k+1)(n-k+1)}}$. By AM–GM, $(k+1)(n-k+1)\le\left(\frac{n+2}2\right)^2$, so each of the $n+1$ summands is at least $\frac2{n+2}$, and $$|c_n|\ge\frac{2(n+1)}{n+2}\ge1 .$$ The terms do not tend to $0$, so $\sum c_n$ diverges. Both factors converge, but only conditionally, so Mertens' theorem does not apply.
(d) Absolutely convergent factors Here $c_n=\sum_{k=0}^n x^kx^{n-k}=(n+1)x^n$. Both factors converge absolutely for $|x|\lt1$, so by Theorem 2.37 $\sum(n+1)x^n=\frac1{(1-x)^2}$. At $x=\frac12$: $\sum_{n\ge0}\frac{n+1}{2^n}=4$, which agrees with Example 1(b): $\sum\frac n{2^n}+\sum\frac1{2^n}=2+2$.
⚠️ Counterexamples and pitfalls
  1. $a_n\to0$ is necessary, not sufficient: $\sum\frac1n$, $\sum\log\left(1+\frac1n\right)$ and $\sum\frac1{\sqrt n+\sqrt{n+1}}$ all diverge.
  2. An exponent above $1$ is not enough unless it stays away from $1$: $\sum\frac1{n^{1+1/n}}$ diverges (Example 2(e)).
  3. Limit comparison needs non-negative terms: $\frac{(-1)^n}{\sqrt n}$ and $\frac{(-1)^n}{\sqrt n}+\frac1n$ have ratio $\to1$, yet only the first gives a convergent series.
  4. Ratio and root tests are blind at $1$: $\sum\frac1n$ and $\sum\frac1{n^2}$ both give $1$ in both tests.
  5. $\limsup\frac{a_{n+1}}{a_n}\gt1$ does not imply divergence: the series with terms $2^{-n}$ (odd $n$) and $3^{-n}$ (even $n$) converges (Example 4(d)). Divergence follows only if $\frac{|a_{n+1}|}{|a_n|}\ge1$ eventually, or from $\limsup|a_n|^{1/n}\gt1$.
  6. Leibniz needs monotonicity: $\sum\frac{(-1)^n}{\sqrt n+(-1)^n}$ alternates with terms $\to0$, but diverges (Example 5(c)).
  7. Convergence of $\sum a_n$ says nothing about $\sum a_n^2$ or $\sum a_n^3$: $a_n=\frac{(-1)^n}{\sqrt n}$ defeats $\sum a_n^2$. For cubes, use the blocks $\left(x_k,-\frac{x_k}2,-\frac{x_k}2\right)$ with $x_k=k^{-1/3}$ (Exercise IV.2). For $a_n\ge0$, $\sum a_n^2$ does converge, but $\sum\sqrt{a_n}$ need not: $a_n=\frac1{n^2}$.
  8. $\sum a_n$ convergent and $b_n\to1$ do not make $\sum a_nb_n$ converge: Example 6(d). With absolute convergence and bounded $(b_n)$ it does.
  9. $na_n\to0$ needs monotonicity and is not sufficient: $a_n=\frac1n$ on squares and $\frac1{n^2}$ elsewhere gives a convergent series with $na_n\not\to0$, while $\frac1{n\log n}$ has $na_n\to0$ and a divergent series.
  10. Brackets can be inserted, not removed: $(1-1)+(1-1)+\cdots=0$, but $1-1+1-\cdots$ diverges.
  11. Order matters for conditionally convergent series: $1+\frac13-\frac12+\frac15+\frac17-\frac14+\cdots=\frac32\log2$, while the same terms in the original order give $\log2$. Even rearrangements that keep the positive terms and the negative terms in their own orders can change the sum.
  12. The Cauchy product of two convergent series can diverge: $\sum\frac{(-1)^n}{\sqrt{n+1}}$ with itself (Example 7(c)). One absolutely convergent factor is enough to prevent this (Mertens).
  13. A subseries of a convergent series need not converge: the even-indexed terms of $\sum\frac{(-1)^n}n$ form $\sum\frac1{2k}$. For non-negative or absolutely convergent series every subseries converges.

Exercises

I
Partial sums, telescoping and the Cauchy criterion.
  • 1 Find $\displaystyle\sum_{n=1}^\infty\frac1{n(n+2)}$.
  • 2 Find $\displaystyle\sum_{n=1}^\infty\frac{2n+1}{n^2(n+1)^2}$.
  • 3 Find $\displaystyle\sum_{n=0}^\infty\frac{2^n+3^n}{6^n}$.
  • 4 Find $\displaystyle\sum_{n=1}^\infty\frac{n^2}{2^n}$, using Example 1(b).
  • 5 Find $\displaystyle\sum_{n=2}^\infty\log\Big(1-\frac1{n^2}\Big)$.
  • 6 Show that $\displaystyle\sum\frac1{\sqrt n+\sqrt{n+1}}$ diverges by computing its partial sums.
  • 7 Prove that $\displaystyle\sum_{n=1}^\infty\arctan\frac1{2n^2}=\frac\pi4$. (Show that $\arctan\frac1{2n^2}$ equals $\arctan(2n+1)-\arctan(2n-1)$.)
  • 8 Let $a_n\ge0$ and let $\sum a_n$ converge. Prove that $\sum_ka_{n_k}$ converges for every subsequence $(a_{n_k})$. Show by an example that this fails without $a_n\ge0$.
1 $\frac1{n(n+2)}=\frac12\left(\frac1n-\frac1{n+2}\right)$. Then $s_N=\frac12\left(1+\frac12-\frac1{N+1}-\frac1{N+2}\right)\to\frac34$.
2 $(n+1)^2-n^2=2n+1$, so the term is $\frac1{n^2}-\frac1{(n+1)^2}$. Telescoping gives the sum $1$.
3 Split into two geometric series: $\sum\left(\frac13\right)^n+\sum\left(\frac12\right)^n=\frac32+2=\frac72$.
4 The series converges (ratio $\to\frac12$, Theorem 2.29). Call its sum $S$. Then $\frac S2=\sum_{m\ge1}\frac{(m-1)^2}{2^m}$, so $S-\frac S2=\sum_{m\ge1}\frac{2m-1}{2^m}=2\cdot2-1=3$. Hence $S=6$.
5 $\sum_{n=2}^N\log\frac{(n-1)(n+1)}{n^2}=\log\prod_{n=2}^N\frac{n-1}n\cdot\frac{n+1}n=\log\left(\frac1N\cdot\frac{N+1}2\right)\to\log\frac12$. The sum is $-\log2$.
6 Multiply by the conjugate: $\frac1{\sqrt n+\sqrt{n+1}}=\sqrt{n+1}-\sqrt n$. So $s_N=\sqrt{N+1}-1\to\infty$, although the terms tend to $0$.
7 $\tan(\alpha-\beta)=\frac{(2n+1)-(2n-1)}{1+(4n^2-1)}=\frac1{2n^2}$, and $\alpha-\beta\in(0,\frac\pi2)$, which proves the identity. Telescoping gives $s_N=\arctan(2N+1)-\arctan1\to\frac\pi2-\frac\pi4=\frac\pi4$.
8 The partial sums of the subseries are at most $\sum a_n$, so they are bounded, and Theorem 2.23 applies. Counterexample: $a_n=\frac{(-1)^n}n$. Its even-indexed terms form $\sum\frac1{2k}$, which diverges. (The same proof works for absolutely convergent series.)
II
Series of non-negative terms. In 1–9 decide whether the series converges.
  • 1 $\displaystyle\sum\frac{n+1}{n^3+2}$
  • 2 $\displaystyle\sum\frac1{\sqrt{n(n+1)}}$
  • 3 $\displaystyle\sum\frac{\sqrt{n+1}-\sqrt n}{n}$
  • 4 $\displaystyle\sum n^2e^{-\sqrt n}$
  • 5 $\displaystyle\sum_{n\ge2}\frac1{(\log n)^{10}}$
  • 6 $\displaystyle\sum_{n\ge3}\frac1{(\log n)^{\log\log n}}$
  • 7 $\displaystyle\sum\frac{(n!)^2}{(2n)!}$
  • 8 $\displaystyle\sum\frac{n^n}{3^n\,n!}$
  • 9 $\displaystyle\sum\Big(1-\frac1n\Big)^{n^2}$
  • 10 For which real $p$ does $\displaystyle\sum_{n\ge2}\frac1{n^p\log n}$ converge?
1 Converges. The ratio of the term to $\frac1{n^2}$ tends to $1$; use limit comparison with $\sum\frac1{n^2}$.
2 Diverges. $\sqrt{n(n+1)}\le n+1$, so the term is at least $\frac1{n+1}$; compare with the harmonic series.
3 Converges. The term equals $\frac1{n(\sqrt{n+1}+\sqrt n)}\le\frac1{2n^{3/2}}$.
4 Converges. $e^{t}\ge\frac{t^8}{8!}$ for $t\ge0$ (one term of the exponential series). With $t=\sqrt n$ this gives $n^2e^{-\sqrt n}\le\frac{8!\,n^2}{n^4}=\frac{40320}{n^2}$.
5 Diverges. With $n=e^t$, $\frac{(\log n)^{10}}n=\frac{t^{10}}{e^t}\to0$ (§2.1), so $(\log n)^{10}\le n$ eventually and the term is at least $\frac1n$. No power of $\log n$ can beat the harmonic series.
6 Diverges. $(\log n)^{\log\log n}=e^{(\log\log n)^2}$. For $t\ge1$, $(\log t)^2\le t$, since $\frac{(\log t)^2}t$ has maximum $\frac4{e^2}\lt1$ at $t=e^2$. With $t=\log n$ this gives $(\log\log n)^2\le\log n$, so the term is at least $\frac1n$ for $n\ge3$. Compare Example 2(f): exponent $\log n$ gives convergence, exponent $\log\log n$ gives divergence.
7 Converges. The ratio is $\frac{(n+1)^2}{(2n+2)(2n+1)}\to\frac14$.
8 Converges. The ratio is $\frac{(n+1)^{n+1}}{3(n+1)n^n}=\frac{(1+1/n)^n}3\to\frac e3\lt1$.
9 Converges. The root is $\left(1-\frac1n\right)^n\to\frac1e\lt1$.
10 Exactly for $p\gt1$. If $p\gt1$, the term is at most $\frac1{n^p}$ for $n\ge3$. If $p\lt1$, then $n^{1-p}\ge\log n$ eventually, so the term is at least $\frac1n$. If $p=1$, it is $\frac1{n\log n}$, which diverges (Theorem 2.26(b)).
III
Absolute and conditional convergence. In 1–6 decide whether the series converges absolutely, converges conditionally, or diverges.
  • 1 $\displaystyle\sum\frac{(-1)^nn}{n^2+1}$
  • 2 $\displaystyle\sum(-1)^n\big(\sqrt{n+1}-\sqrt n\big)$
  • 3 $\displaystyle\sum(-1)^n\sin\frac1n$
  • 4 $\displaystyle\sum(-1)^n\Big(1-\cos\frac1n\Big)$
  • 5 $\displaystyle\sum_{n\ge2}\frac{(-1)^n}{\log n}$
  • 6 $\displaystyle\sum\frac{\cos(n\pi/3)}{n}$
  • 7 Prove that $1-\frac12+\frac13-\cdots=\log2$, using $s_{2n}=H_{2n}-H_n$ and Theorem 2.27.
  • 8 How many terms of $\sum\frac{(-1)^{n+1}}{n^3}$ guarantee an error below $10^{-4}$?
  • 9 Find all real $x$ for which $\sum\frac{x^n}n$ converges, and say where the convergence is absolute.
  • 10 Prove that $\displaystyle\sum_{n=1}^\infty\frac{(-1)^{\lfloor\sqrt n\rfloor}}n$ converges. (Group the terms with $k^2\le n\lt(k+1)^2$ and show that the block sums $b_k$ satisfy $\left|b_k-\frac2k\right|\le\frac3{k^2}$.)
1 Conditionally. $\frac x{x^2+1}$ decreases for $x\ge1$ (its derivative is $\frac{1-x^2}{(x^2+1)^2}$) and tends to $0$, so Leibniz applies. The absolute values behave like $\frac1n$.
2 Conditionally. $\sqrt{n+1}-\sqrt n=\frac1{\sqrt{n+1}+\sqrt n}$ decreases to $0$, so Leibniz applies. The absolute values are at least $\frac1{2\sqrt{n+1}}$, whose series diverges.
3 Conditionally. $\sin\frac1n$ decreases to $0$, so Leibniz applies. $\sum\sin\frac1n$ diverges (Example 2(b)).
4 Absolutely. $0\le1-\cos\frac1n\le\frac1{2n^2}$.
5 Conditionally. $\frac1{\log n}$ decreases to $0$, so Leibniz applies. Since $\frac1{\log n}\ge\frac1n$, the absolute series diverges.
6 Conditionally. $\cos\frac{n\pi}3$ runs through $\frac12,-\frac12,-1,-\frac12,\frac12,1$, with partial sums $\frac12,0,-1,-\frac32,-1,0$, which are bounded by $\frac32$. So Dirichlet's test applies with $b_n=\frac1n$. Since $\left|\cos\frac{n\pi}3\right|\ge\frac12$, the absolute series diverges.
7 $s_{2n}=\left(1+\frac12+\cdots+\frac1{2n}\right)-2\left(\frac12+\frac14+\cdots+\frac1{2n}\right)=H_{2n}-H_n$. This equals $(H_{2n}-\log2n)-(H_n-\log n)+\log2\to\gamma-\gamma+\log2$. Since $s_{2n+1}-s_{2n}\to0$, $s_n\to\log2$.
8 By Theorem 2.32 we need $\frac1{(n+1)^3}\lt10^{-4}$, that is, $(n+1)^3\gt10^4$. Since $21^3=9261$ and $22^3=10648$, $n=21$ terms suffice.
9 The ratio test gives $|x|$. So the series converges absolutely for $|x|\lt1$ and diverges for $|x|\gt1$ (the terms are unbounded). At $x=1$ it is the harmonic series, which diverges. At $x=-1$ it converges conditionally (Leibniz). Answer: $[-1,1)$.
10 Block $k$ has $2k+1$ terms of sign $(-1)^k$, each between $\frac1{(k+1)^2}$ and $\frac1{k^2}$. So $|b_k|$ lies between $\frac{2k+1}{(k+1)^2}$ and $\frac{2k+1}{k^2}$. Now $\frac{2k+1}{k^2}-\frac2k=\frac1{k^2}$ and $\frac2k-\frac{2k+1}{(k+1)^2}=\frac{3k+2}{k(k+1)^2}\le\frac3{k^2}$. Hence $|b_k|=\frac2k+O\!\left(\frac1{k^2}\right)$, and $\sum(-1)^k|b_k|$ converges: $\sum\frac{2(-1)^k}k$ converges by Leibniz, and the remainder converges absolutely. Inside each block the terms have one sign, so the original series converges too (Theorem 2.21(5)).
IV
Theory, rearrangements, products and an application.
  • 1 Let $a_n\ge0$ and let $\sum a_n$ converge. Prove that $\sum a_n^2$, $\sum\frac{a_n}{1+a_n}$ and $\sum\sqrt{a_na_{n+1}}$ converge.
  • 2 Give an example of a convergent series $\sum a_n$ for which $\sum a_n^3$ diverges.
  • 3 Prove that if $\sum a_n$ converges absolutely and $(b_n)$ is bounded, then $\sum a_nb_n$ converges absolutely. Show that "absolutely" cannot be weakened to "conditionally".
  • 4 Find the sum of $1+\frac13+\frac15-\frac12-\frac14$ $+\frac17+\frac19+\frac1{11}-\frac16-\frac18$ $+\cdots$ (three positive terms, then two negative).
  • 5 Prove that the Cauchy product of $\sum_{n\ge0}\frac{x^n}{n!}$ and $\sum_{n\ge0}\frac{y^n}{n!}$ is $\sum_{n\ge0}\frac{(x+y)^n}{n!}$, and conclude that $E(x)E(y)=E(x+y)$ for $E(x)=\sum\frac{x^n}{n!}$.
  • 6 Show that the Cauchy product of $\sum_{n\ge0}\frac{(-1)^n}{n+1}$ with itself has terms $c_n=(-1)^n\frac{2H_{n+1}}{n+2}$, that it converges, and find its sum.
  • 7 Let $(a_n)$ be decreasing, $a_n\ge0$, and let $\sum a_n$ converge. Prove that $\sum n(a_n-a_{n+1})$ converges and has the same sum.
  • 8 Describe a rearrangement of $1-\frac12+\frac13-\cdots$ that diverges to $+\infty$, and one whose partial sums have $\liminf=-1$ and $\limsup=2$.
  • 9 Applied. A ball is dropped from a height of $2$ m. After each bounce it rises to $\frac34$ of its previous height. Find the total distance travelled and, with $g=9.81\ \text{m/s}^2$ and no air resistance, the total time until it comes to rest. (A fall from height $h$ takes $\sqrt{2h/g}$ seconds.)
1 Eventually $a_n\le1$, so $a_n^2\le a_n$. Also $\frac{a_n}{1+a_n}\le a_n$, and by AM–GM $\sqrt{a_na_{n+1}}\le\frac{a_n+a_{n+1}}2$. Apply the comparison test in each case.
2 For $k=1,2,\dots$ write the block $x_k,-\frac{x_k}2,-\frac{x_k}2$ with $x_k=k^{-1/3}$. After each complete block the partial sum is $0$, and inside block $k$ it is $x_k$ or $\frac{x_k}2$. Since $x_k\to0$, the series converges to $0$. But each block contributes $x_k^3\left(1-\frac18-\frac18\right)=\frac3{4k}$ to $\sum a_n^3$, which therefore diverges.
3 If $|b_n|\le M$, then $|a_nb_n|\le M|a_n|$; apply the comparison test. Counterexample: $a_n=\frac{(-1)^n}n$ and $b_n=(-1)^n$ give $\sum\frac1n$.
4 By Example 7(a) with $p=3$, $q=2$, the sum is $\log2+\frac12\log\frac32\approx0.6931+0.2027=0.8959$. (Numerically, $10^6$ blocks give $0.89588$.)
5 $c_n=\sum_{k=0}^n\frac{x^k}{k!}\frac{y^{n-k}}{(n-k)!}=\frac1{n!}\sum_k\binom nkx^ky^{n-k}=\frac{(x+y)^n}{n!}$ by the binomial theorem. Both series converge absolutely (ratio test), so Theorem 2.37 gives $E(x)E(y)=E(x+y)$.
6 Partial fractions give $\frac1{(k+1)(n-k+1)}=\frac1{n+2}\left(\frac1{k+1}+\frac1{n-k+1}\right)$. Summing over $k$ gives $|c_n|=\frac{2H_{n+1}}{n+2}$. This tends to $0$ (since $H_n\sim\log n$) and does not increase: $\frac{H_{n+1}}{n+2}-\frac{H_{n+2}}{n+3}=\frac{H_{n+1}-1}{(n+2)(n+3)}\ge0$. So $\sum c_n$ converges by Leibniz, and its sum is $(\log2)^2\approx0.48045$ by Abel's product theorem (Theorem 2.37(c)), although Mertens' theorem does not apply.
7 Summing and shifting the index gives $\sum_{n=1}^Nn(a_n-a_{n+1})=s_N-Na_{N+1}$. By Example 6(e), $(N+1)a_{N+1}\to0$, so $Na_{N+1}\to0$ as well, and the partial sums tend to $\sum a_n$.
8 To $+\infty$: take positive terms until the sum exceeds $1$, then one negative term, then positive terms until the sum exceeds $2$, then one negative term, and so on. Each stage is finite because $\sum\frac1{2k-1}=\infty$. After stage $m$ every partial sum is above $m-1$, so the partial sums tend to $+\infty$. Oscillation: take positive terms until the sum exceeds $2$, then negative terms until it drops below $-1$, and repeat. The overshoots tend to $0$, so the partial sums have $\limsup=2$ and $\liminf=-1$.
9 The rebound heights are $h_k=2\left(\frac34\right)^k$, and each is travelled twice. Distance: $2+2\sum_{k\ge1}2\left(\frac34\right)^k=2+2\cdot6=14$ m. Time: $\sqrt{h_k}=\sqrt2\,r^k$ with $r=\frac{\sqrt3}2$, so $$T=\sqrt{\tfrac{4}{g}}\Big(1+2\sum_{k\ge1}r^k\Big)=\sqrt{\tfrac4g}\Big(1+\frac{2r}{1-r}\Big)\approx0.6386\times13.93\approx8.89\ \text{s}.$$ Infinitely many bounces happen in under $9$ s, which is Zeno's paradox resolved by a geometric series.
🎯 Exam corner CSIR Part BCSIR Part CGATE MA

E1. CSIR Part B GATE MA Which of the following series converges? (A) $\displaystyle\sum_{n\ge1}\Big(\frac1n-\log\Big(1+\frac1n\Big)\Big)$; (B) $\displaystyle\sum_{n\ge1}\big(e^{1/n}-1\big)$; (C) $\displaystyle\sum_{n\ge1}\frac1{\sqrt n+\log n}$; (D) $\displaystyle\sum_{n\ge2}\frac1{(\log n)^2}$.

Idea Find the dominant term of each and compare with the $p$-scale.
Work (A) $0\le x-\log(1+x)\le\frac{x^2}2$ for $x\ge0$, so the terms are at most $\frac1{2n^2}$: converges. Its partial sums are $H_N-\log(N+1)$, so the sum is Euler's $\gamma$. (B) $e^{1/n}-1\ge\frac1n$: diverges. (C) The terms are at least $\frac1{2\sqrt n}$: diverges. (D) The terms are at least $\frac1n$ eventually: diverges.
Answer (A).

E2. CSIR Part B The set of all $x\gt0$ for which $\displaystyle\sum_{n\ge1}\frac{n!\,x^n}{n^n}$ converges is (A) $(0,1)$; (B) $(0,e)$; (C) $(0,e]$; (D) $(0,\infty)$.

Idea Use the ratio test for the interior and examine the boundary separately.
Work $\dfrac{a_{n+1}}{a_n}=x\Big(\dfrac n{n+1}\Big)^n\to\dfrac xe$. So the series converges for $x\lt e$ and diverges for $x\gt e$. At $x=e$ the ratio is $\dfrac e{(1+1/n)^n}\gt1$, because $(1+\frac1n)^n\lt e$. So the terms increase from $a_1=e$, do not tend to $0$, and the series diverges.
Answer (B).

E3. CSIR Part B The terms of $1-\frac12+\frac13-\frac14+\cdots$ are rearranged as $1+\frac13+\frac15+\frac17-\frac12$ $+\frac19+\frac1{11}+\frac1{13}+\frac1{15}-\frac14$ $+\cdots$ (four positive terms, then one negative, each kind in its original order). The rearranged series (A) converges to $\log2$; (B) converges to $\frac32\log2$; (C) converges to $2\log2$; (D) diverges to $+\infty$.

Idea Use Example 7(a): a $p$-positive, $q$-negative pattern sums to $\log2+\frac12\log\frac pq$.
Work With $p=4$, $q=1$: $\log2+\frac12\log4=\log2+\log2=2\log2\approx1.3863$. Numerically, $2\times10^5$ blocks give $1.38629$. Option (D) is tempting because the positive terms outnumber the negative ones, but every term still tends to $0$ and the counts grow in a fixed ratio.
Answer (C).

E4. CSIR Part C Let $\sum a_n$ be a convergent series of real numbers. Which of the following are true? (One or more options may be correct.) (A) $\sum a_n^2$ converges. (B) $\sum\frac{a_n}n$ converges. (C) If $a_n\gt0$ for all $n$, then $\sum a_n^2$ converges. (D) $\sum(a_n+a_{n+1})$ converges.

(A) False $a_n=\frac{(-1)^n}{\sqrt n}$ gives $\sum a_n^2=\sum\frac1n$.
(B) True Abel's test: $\sum a_n$ converges and $\frac1n$ is monotone and bounded.
(C) True $a_n\to0$, so eventually $0\lt a_n\lt1$ and $a_n^2\le a_n$.
(D) True It is the sum of $\sum a_n$ and the shifted series $\sum a_{n+1}$, and its sum is $2\sum a_n-a_1$.
Answer (B), (C) and (D).

E5. CSIR Part C GATE MA Let $a_n\gt0$ for all $n$. Which of the following are true? (A) If $\sum a_n$ converges, then $\sum\frac{\sqrt{a_n}}n$ converges. (B) If $\sum a_n$ converges, then $na_n\to0$. (C) If $\limsup\frac{a_{n+1}}{a_n}\gt1$, then $\sum a_n$ diverges. (D) If $\limsup a_n^{1/n}\lt1$, then $\sum a_n$ converges.

(A) True $\frac{\sqrt{a_n}}n\le\frac12\left(a_n+\frac1{n^2}\right)$ (Example 6(c)).
(B) False Take $a_n=\frac1n$ for perfect squares $n$ and $a_n=\frac1{n^2}$ otherwise. The series converges, but $na_n=1$ infinitely often. (The statement is true for decreasing $a_n$.)
(C) False Take $a_n=2^{-n}$ ($n$ odd) and $3^{-n}$ ($n$ even). Here $\limsup\frac{a_{n+1}}{a_n}=\infty$, yet the series converges to $\frac{19}{24}$ (Example 4(d)).
(D) True This is the root test (Theorem 2.28).
Answer (A) and (D).

E6. CSIR Part C Let $\sum a_n$ be conditionally convergent. Which of the following are true? (A) The series of positive terms of $\sum a_n$ diverges. (B) Some rearrangement of $\sum a_n$ diverges to $+\infty$. (C) Every rearrangement that keeps the positive terms in their original order and the negative terms in their original order has the same sum as $\sum a_n$. (D) The Cauchy product of $\sum a_n$ with itself converges.

(A) True Theorem 2.31(c): $\sum a_n^+=+\infty$.
(B) True This is the Riemann rearrangement theorem (Theorem 2.36).
(C) False The rearrangement $1+\frac13-\frac12+\frac15+\frac17-\frac14+\cdots$ keeps both orders and sums to $\frac32\log2\ne\log2$. The greedy construction of Theorem 2.36 also keeps both orders.
(D) False For $a_n=\frac{(-1)^n}{\sqrt{n+1}}$ the Cauchy square has $|c_n|\ge1$ (Example 7(c)). (For $a_n=\frac{(-1)^n}{n+1}$ it happens to converge, Exercise IV.6, so the statement is not "never" either.)
Answer (A) and (B).
🧑‍🏫 For the teacher

Suggested plan — 3 lectures × 60 min.

  1. Foundations and comparison. Open with the chapter teaser (harmonic vs $\sum\frac1{n^2}$). Definition 2.10, Theorem 2.21 (prove the Cauchy criterion and the $n$-th term test; discuss grouping with $1-1+1-\cdots$), geometric and telescoping series, Example 1 on the board. Theorem 2.23, the comparison tests, the condensation test with its picture of dyadic blocks, Theorem 2.26. Example 2(d), (e) and (f) make good "predict first" questions.
  2. Integral, root, ratio and Raabe. The integral test with the staircase picture and Euler's constant, Example 3(b). The root test with $\limsup$, the ratio test, and the comparison between them via Theorem 2.18. Project Interactive 1 and run Σ n!/nⁿ, then the odd/even series, then 1/n² against 1/n. Raabe's test with its two-line proof and Example 4(e). Finish with the strategy box.
  3. Signs, order and products. Absolute and conditional convergence, Leibniz (draw the nested partial sums), summation by parts, Dirichlet and Abel, Example 5(b) and (c). Riemann's theorem: let the class pick a target and project Interactive 2. Example 7(a) explains the predicted ratio $p/q$. Mertens' theorem and the divergent product of Example 7(c). Close with E4 or E6.

Discussion questions. (1) Every test for non-negative series ultimately proves that partial sums are bounded. Which comparison series sits behind each test? (2) Why can no test based on $a_{n+1}/a_n$ alone decide every series with ratio tending to $1$? (Compare $\frac1n$ with $\frac1{n\log^2n}$.) (3) Is there a "slowest divergent series", that is, one that every divergent positive series dominates? (No: if $\sum a_n$ diverges with partial sums $s_n$, then $\sum\frac{a_n}{s_n}$ also diverges.)

Misconceptions to watch for. Treating $a_n\to0$ as sufficient; using limit comparison with terms of changing sign; reading "$\limsup$ ratio $\gt1$" as divergence; applying Leibniz without checking monotonicity; believing that convergence of $\sum a_n$ implies convergence of $\sum a_n^2$; removing brackets freely; assuming the sum of a convergent series is independent of the order; multiplying two conditionally convergent series.

Suggested homework. I(1, 4, 5, 7, 8), II(2, 4, 5, 6, 8, 10), III(1, 2, 6, 8, 9, 10), IV(1, 2, 4, 6, 9); Exam corner E2, E4, E5.

🔬 Research–Teaching NexusResearch-tutored · optional, about 60 minutes

Research question. The harmonic series diverges. What happens if we delete every term whose denominator contains the digit $9$? This gives the Kempner series $1+\frac12+\cdots+\frac18+\frac1{10}+\cdots+\frac1{18}+\frac1{20}+\cdots$. Does it converge, and if so, can its sum be computed?

Why it matters. The Kempner series converges, yet its partial sums creep upward so slowly that direct summation of billions of terms is far from the sum. It is a standard test case for convergence acceleration: methods that estimate the sum of a slowly convergent series from a few of its terms. The same ideas are used in computational physics (lattice sums in crystallography), in numerical number theory, and wherever an infinite sum must be evaluated to many digits with finite effort. It also shows that a divergent series can lose its divergence when a "thin-looking" set of terms is removed: almost all large integers contain a $9$.

What to do.

  1. Show that there are $8\cdot9^{k-1}$ integers with exactly $k$ digits and no digit $9$. Each is at least $10^{k-1}$, so their reciprocals sum to at most $8\left(\frac9{10}\right)^{k-1}$. Deduce convergence with sum at most $80$. This is a condensation-type argument in base $10$.
  2. Sharpen the bound by splitting by the leading digit $d\in\{1,\dots,8\}$: show that the sum is at most $10\left(1+\frac12+\cdots+\frac18\right)\approx27.18$.
  3. Compute the partial sums $K_m$ over all such $n\lt10^m$ for $m=1,\dots,7$ (or $8$ with vectorised code). Look at the differences $K_{m+1}-K_m$: roughly what ratio do they decrease by? Use this to extrapolate the sum with a geometric tail estimate.
  4. Compare your estimate with the known value $22.9206766\ldots$ How many terms would naive summation need to reach it to within $0.01$?
  5. Repeat steps 1–2 for "no digit $0$" or "no string $42$". Do the arguments still work?

Tools: Python (NumPy) or any language with fast loops; a spreadsheet is enough for steps 1–2.

Hand in: Your proofs of steps 1–2, a table of $K_m$ and $K_{m+1}-K_m$, your extrapolated sum with an honest error estimate, and two sentences explaining why "almost all integers contain a $9$" is consistent with convergence.

Going further. Read about Baillie's and Schmelzer–Baillie's algorithms, which compute Kempner-type sums to many digits by organising the terms by their digit blocks, and about Richardson extrapolation and the Euler–Maclaurin formula as general acceleration tools.

Instructor note: $K_1=H_8\approx2.7179$, $K_2\approx4.7718$, $K_3\approx6.5897$, $K_4\approx8.2231$, $K_5\approx9.6929$, $K_6\approx11.0157$, $K_7\approx12.2062$, $K_8\approx13.2776$. The differences shrink by factors close to $0.9$ ($1.634\to1.470\to1.323\to1.190\to1.071$). A geometric tail with ratio $0.9$ after $K_8$ adds about $9\times1.0715\approx9.64$, giving $\approx22.9$, close to the true $22.92068$. Naive summation is hopeless: the remainder after all no-9 integers below $10^m$ is roughly $10\cdot(0.9)^m$, so an error of $0.01$ needs $m\approx66$, that is, terms beyond $10^{65}$. In step 5, "no digit 0" behaves the same way with $9^k$ admissible $k$-digit numbers. "No string 42" also converges, but the count needs a recurrence rather than a closed formula.

🧪 Self-check quiz

0/5 correct

Q1. The series $\sum_{n\ge1}\frac1{n^p}$ converges exactly when

Q2. The series $\sum_{n\ge1}\frac{(-1)^{n+1}}{\sqrt n}$

Q3. For $\sum\frac{n^5}{3^n}$ the ratio $\frac{a_{n+1}}{a_n}$

Q4. Let $s=\sum_{n\ge1}\frac{(-1)^{n+1}}{n^2}$ and $s_{10}$ its tenth partial sum. The Leibniz estimate gives

Q5. If $\sum a_n$ converges conditionally, then by Riemann's theorem