Special Series

⚡ Key Takeaways

Special series are infinite series of fundamental importance — geometric, harmonic, $p$ -series, telescoping, alternating harmonic, and power-series expansions of elementary functions — whose convergence behavior and closed-form sums are known and serve as benchmarks for the entire theory of infinite series. Key result: a geometric series $\sum ar^n$ converges to $a/(1-r)$ iff $|r|<1$ ; the harmonic series $\sum 1/n$ diverges; the $p$ -series $\sum 1/n^p$ converges iff $p>1$ . Where it applies: convergence tests (comparison), Taylor series, generating functions, physics, finance, computer science. Who/when: developed from Archimedes (geometric, 3rd c. BCE) through Oresme, the Bernoullis, Euler, Cauchy (19th c. rigor).

💡 The Core Insight

Convergence is a tail phenomenon: it depends only on how fast the terms $a_n \to 0$ , not on any finite prefix. The special series form a calibrated "ruler" of decay rates — geometric decay ( $r^n$ ) is fast enough to converge, the harmonic decay ( $1/n$ ) is the borderline failure, and the $p$ -series ( $1/n^p$ ) sweeps continuously across the convergence boundary at $p=1$ . Master these benchmarks and you can resolve almost any series by comparison.

DefinitionInfinite Series and Convergence

Given a sequence $(a_n)_{n\ge 1}$ , the infinite series is the formal sum $\sum_{n=1}^\infty a_n$ . Its partial sums are

1

\quad S_N = \sum_{n=1}^{N} a_n .

Derivation hint: a series is defined as the limit of its sequence of partial sums; this converts an infinite sum into a sequence limit. The series converges to $S$ if $\lim_{N\to\infty} S_N = S$ exists (finite); otherwise it diverges. Here $a_n$ denotes the $n$ -th term, $N$ the cutoff index, $S_N$ the $N$ -th partial sum, and $S$ the sum.

DefinitionThe Geometric Series

The geometric series with first term $a\neq 0$ and common ratio $r$ is

2

\quad \sum_{n=0}^{\infty} a r^n = a + ar + ar^2 + \cdots .

Derivation hint: each term is the previous multiplied by the fixed ratio $r$ ; the index starts at $0$ so the first term is $ar^0=a$ . Its closed form, valid for $|r|<1$ , is

3

\quad \sum_{n=0}^{\infty} a r^n = \frac{a}{1-r}, \qquad |r|<1 .

Derivation hint: multiply the finite partial sum by $(1-r)$ to telescope, then take $N\to\infty$ using $r^N\to 0$ .

DefinitionThe

p

-Series and Harmonic Series

The $p$ -series is

4

\quad \sum_{n=1}^{\infty} \frac{1}{n^p}, \qquad p \in \mathbb{R}.

Derivation hint: generalize the harmonic series by raising the denominator to a power $p$ ; the case $p=1$ recovers the harmonic series. The case $p=1$ is the harmonic series $\sum_{n=1}^\infty 1/n$ . The series converges iff $p>1$ and diverges iff $p\le 1$ .

TheoremConvergence of the Special Series

1. Geometric: $\sum_{n=0}^\infty ar^n$ converges to $\dfrac{a}{1-r}$ iff $|r|<1$ ; diverges for $|r|\ge 1$ . 2. $p$ -series: $\sum_{n=1}^\infty n^{-p}$ converges iff $p>1$ . 3. Harmonic ( $p=1$ ): diverges. 4. Alternating harmonic: $\sum_{n=1}^\infty \dfrac{(-1)^{n+1}}{n} = \ln 2$ (converges conditionally). 5. Basel / even $p$ : $\sum_{n=1}^\infty \dfrac{1}{n^2} = \dfrac{\pi^2}{6}$ , and generally $\sum n^{-2k} = \dfrac{(-1)^{k+1}B_{2k}(2\pi)^{2k}}{2(2k)!}$ .

TheoremTerm Test for Divergence

If $\sum a_n$ converges, then $\lim_{n\to\infty} a_n = 0$ . Contrapositive: if $a_n \not\to 0$ , the series diverges.

5

\quad \sum_{n=1}^\infty a_n \text{ converges} \;\Longrightarrow\; \lim_{n\to\infty} a_n = 0 .

Derivation hint: $a_N = S_N - S_{N-1}$ ; if both partial sums tend to $S$ , their difference tends to $0$ .

Warning: the converse fails — the harmonic series has $a_n=1/n\to 0$ yet diverges.

ProofGeometric Series Closed Form

Step 1. Write the finite partial sum:

6

\quad S_N = a + ar + ar^2 + \cdots + ar^{N-1} .

Derivation hint: sum the first $N$ terms explicitly.

Step 2. Multiply by $r$ :

7

\quad rS_N = ar + ar^2 + \cdots + ar^{N} .

Derivation hint: shift every term up by one power of $r$ .

Step 3. Subtract [7] from [6]; the middle terms telescope:

8

\quad S_N(1-r) = a - ar^N \;\Longrightarrow\; S_N = \frac{a(1-r^N)}{1-r}, \quad r\neq 1.

Derivation hint: nearly all terms cancel pairwise, leaving only the first of [6] and last of [7].

Step 4. Take $N\to\infty$ . If $|r|<1$ then $r^N\to 0$ , so $S_N \to a/(1-r)$ . If $|r|\ge 1$ then $r^N$ does not tend to $0$ , so $S_N$ has no finite limit. $\blacksquare$

∎

ProofHarmonic Divergence via Oresme's Grouping

Step 1. Group terms in dyadic blocks:

9

\quad \sum_{n=1}^\infty \frac1n = 1 + \tfrac12 + \underbrace{\left(\tfrac13+\tfrac14\right)}_{} + \underbrace{\left(\tfrac15+\cdots+\tfrac18\right)}_{} + \cdots

Derivation hint: collect $2^{k}$ terms running from index $2^k+1$ to $2^{k+1}$ .

Step 2. Each block exceeds $1/2$ : the block from $2^k+1$ to $2^{k+1}$ has $2^k$ terms each $\ge 1/2^{k+1}$ , so the block sum $\ge 2^k\cdot 2^{-(k+1)} = 1/2$ .

Step 3. Since infinitely many blocks each contribute $\ge 1/2$ , the partial sums exceed any bound:

10

\quad S_{2^m} \ge 1 + \frac{m}{2} \to \infty .

Derivation hint: $m$ full blocks each add at least $1/2$ , plus the leading $1$ . Hence the harmonic series diverges. $\blacksquare$

∎

Proof

p

-Series via the Integral Test

For $p>0$ , $f(x)=x^{-p}$ is positive, continuous, decreasing on $[1,\infty)$ . By the integral test the series and integral converge together:

11

\quad \int_1^\infty x^{-p}\,dx = \begin{cases}\dfrac{1}{p-1}, & p>1,\\[4pt]\infty, & p\le 1.\end{cases}

Derivation hint: rectangles of width 1 sandwich the integral between consecutive partial sums; the antiderivative $x^{1-p}/(1-p)$ is finite at infinity iff $1-p<0$ . Thus $\sum n^{-p}$ converges iff $p>1$ . For $p\le 0$ the terms do not tend to $0$ , so divergence also follows from the term test. $\blacksquare$

∎

mathematician · Leonhard Euler | 1707–1783

Euler was the master of special series. In 1735 he solved the Basel problem, proving $\sum 1/n^2 = \pi^2/6$ by an audacious factorization of $\sin(x)/x$ as an infinite product over its roots $\pm n\pi$ — comparing coefficients gave the sum. He generalized this to all even powers via the Bernoulli numbers, defined the Riemann zeta function values $\zeta(2k)$ , introduced what is now the Euler–Mascheroni constant $\gamma = \lim(H_n-\ln n)$ measuring the harmonic series' divergence rate, and produced countless closed forms (the Euler–Maclaurin formula, $e=\sum 1/n!$ ). His blend of formal manipulation and uncanny correctness shaped the subject for a century before Cauchy and Weierstrass supplied rigor.

🧠 Intuition

Think of a series as a budget: each term $a_n$ is a payment, and convergence asks whether the running total stabilizes. Geometric series with $|r|<1$ are like a debt that shrinks by a fixed fraction each step — the remaining tail $ar^N/(1-r)$ vanishes geometrically, so the total settles fast. The harmonic series shrinks only by a smaller and smaller fraction: each new term is just barely smaller than the last, so the total keeps creeping upward forever, just slowly enough to fool the eye. The $p$ -series dial makes this concrete: at $p=1$ you sit exactly on the cliff edge of divergence; nudge to $p=1.001$ and you fall (just barely) into convergence; nudge to $p=0.999$ and you stay divergent. The speed of decay, measured against $1/n$ , is everything.

Figure

Convergence boundary: partial sums of

1/n^p

for

p<1

,

p=1

,

p>1

```svg

```

ExampleGeometric Series with a Real Value

Given: A ball is dropped from height $h_0 = 2\,\text{m}$ and after each bounce rebounds to $\tfrac34$ of its previous height. Find the total vertical distance travelled before it stops.

Step 1. Initial drop: $2\,\text{m}$ .

Step 2. Each subsequent bounce contributes an up and a down trip. The up-heights form a geometric sequence $h_n = 2(3/4)^n$ for $n\ge 1$ . Total up-distance $=\sum_{n=1}^\infty 2(3/4)^n$ .

Step 3. Sum the geometric series (here $a = 2\cdot\tfrac34 = 1.5$ , $r=\tfrac34$ ):

12

\quad \sum_{n=1}^\infty 2(3/4)^n = \frac{1.5}{1-0.75} = 6\,\text{m}.

Derivation hint: factor out one ratio so the sum starts at $n=1$ , then apply $a/(1-r)$ .

Step 4. Each rebound height is travelled twice (up + down): $2\times 6 = 12\,\text{m}$ . Add the original drop:

\boxed{D = 2 + 12 = 14\ \text{m}}

ExampleTelescoping Series Exact Sum

Given: Evaluate $\displaystyle\sum_{n=1}^\infty \frac{1}{n(n+1)}$ .

Step 1. Partial fractions:

13

\quad \frac{1}{n(n+1)} = \frac1n - \frac1{n+1}.

Derivation hint: solve $1 = A(n+1)+Bn$ giving $A=1,\,B=-1$ .

Step 2. Write the partial sum and cancel adjacent terms:

14

\quad S_N = \left(1-\tfrac12\right)+\left(\tfrac12-\tfrac13\right)+\cdots+\left(\tfrac1N-\tfrac1{N+1}\right) = 1 - \frac{1}{N+1}.

Derivation hint: every interior $-1/k$ cancels the next $+1/k$ ; only the first and last survive.

Step 3. Take the limit $N\to\infty$ :

\boxed{\sum_{n=1}^\infty \frac{1}{n(n+1)} = \lim_{N\to\infty}\left(1-\tfrac1{N+1}\right) = 1}

⚠️ Common mistake

"If $a_n\to 0$ , the series converges." False — this is the single most common error. The term test ([5]) is only a necessary condition. The harmonic series is the standard counterexample: $1/n\to 0$ but $\sum 1/n=\infty$ . Likewise, convergence of $\sum a_n$ is unaffected by changing finitely many terms — convergence is purely a tail property — but the sum of course changes.

⚠️ Common mistake

Conditional vs. absolute convergence. The alternating harmonic series $\sum(-1)^{n+1}/n$ converges to $\ln 2$ , but $\sum|(-1)^{n+1}/n| = \sum 1/n$ diverges. Such conditionally convergent series are fragile: by the Riemann rearrangement theorem, their terms can be reordered to sum to any real number, or to $\pm\infty$ . Never assume a series may be freely rearranged unless it converges absolutely.

CounterexampleGeometric formula misused at

r=1

Applying $a/(1-r)$ at $r=1$ gives the nonsensical $a/0$ . Indeed $\sum_{n=0}^\infty 1\cdot 1^n = 1+1+1+\cdots$ diverges; the closed form is only valid for $|r|<1$ . Similarly $\sum (-1)^n = 1-1+1-\cdots$ (the Grandi series, $r=-1$ ) does not converge — its partial sums oscillate between $1$ and $0$ — even though naïvely plugging $r=-1$ gives $1/2$ (a value recoverable only via Cesàro/Abel summation, not ordinary convergence).

connection

Special series are the backbone of the Convergence Tests hierarchy: the comparison test compares against a $p$ -series or geometric series, the ratio test is essentially a local geometric comparison ( $\lim|a_{n+1}/a_n| = r$ ), and the integral test proves the $p$ -series result. They feed directly into Power Series and Taylor Series, since a power series $\sum c_n x^n$ is a geometric-like object whose radius of convergence is found by the root/ratio tests. The $p$ -series generalizes to the Riemann Zeta Function $\zeta(s)=\sum n^{-s}$ , linking elementary analysis to number theory. Telescoping series connect to Partial Fraction Decomposition, and generating functions in Combinatorics are built from geometric series identities.

🔬 Where this appears

⏳ History

- c. 250 BCE — Archimedes sums

\sum (1/4)^n = 4/3

in Quadrature of the Parabola, the first rigorous geometric series, using a geometric exhaustion argument.

- c. 1350 — Nicole Oresme proves the harmonic series diverges by dyadic grouping ([9]–[10]) — a stunningly modern proof, lost and rediscovered centuries later.

- 1647 — Pietro Mengoli poses the Basel problem (

\sum 1/n^2

) and proves harmonic divergence anew.

- 1668 — Nicholas Mercator & 1671 James Gregory derive

\ln(1+x)=\sum(-1)^{n+1}x^n/n

, giving the alternating harmonic series

=\ln 2

.

- 1689 — Jacob Bernoulli publishes Tractatus de seriebus infinitis, systematizing geometric and other series; coins the harmonic-divergence result with attribution to his brother Johann.

- 1735 — Leonhard Euler solves the Basel problem:

\sum 1/n^2 = \pi^2/6

, and soon all even-power sums via Bernoulli numbers.

- 1734 — Euler introduces

\gamma \approx 0.5772

, the constant governing harmonic divergence

H_n \approx \ln n + \gamma

.

- 1821 — Augustin-Louis Cauchy in Cours d'analyse gives the modern

\varepsilon

-definition of series convergence and the Cauchy criterion, putting all prior manipulations on rigorous ground.

- 1837 — Peter Gustav Lejeune Dirichlet and later Riemann (1854) prove the rearrangement theorem, clarifying conditional convergence.

open-problem

The convergence/summation boundary harbors deep mysteries. Odd zeta values are barely understood: Apéry (1979) proved $\zeta(3)=\sum 1/n^3$ irrational, but whether it is transcendental — and whether $\zeta(5),\zeta(7),\dots$ are even irrational — remains open (only that infinitely many are irrational, Rivoal 2000). Divergent series summation (Abel, Cesàro, Borel, Ramanujan) assigns finite values like $\sum n = -1/12$ to divergent series; making such assignments consistent and physically meaningful (e.g. in the Casimir effect and string theory) is subtle and partly unresolved. The precise growth law of harmonic-like partial sums underlies questions about the Riemann Hypothesis, since $\zeta(s)$ extends the $p$ -series to complex $s$ and its zeros control prime distribution.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also