09-01-2026, 09:10 PM
Harmonic Series — Summary
The harmonic series is the infinite sum
$\displaystyle \sum_{n=1}^{\infty}\frac1n=1+\frac12+\frac13+\frac14+\cdots.$
Although its terms $\frac1n$ approach $0$, the series itself diverges: its partial sums grow without bound. This is one of the classic examples showing that the condition $a_n\to0$ is necessary but not sufficient for $\sum a_n$ to converge. A famous proof, essentially due to Nicole Oresme around 1350, groups the terms in blocks whose sizes double. Each block contributes at least $\frac12$, producing infinitely many such contributions. Divergence also follows from the integral test because $\displaystyle \int_1^\infty\frac{dx}{x}=\infty$.
The first $n$ terms form the harmonic number
$\displaystyle H_n=\sum_{k=1}^n\frac1k.$
Despite divergence, these partial sums grow extraordinarily slowly. Their asymptotic behaviour is
$\displaystyle H_n=\ln n+\gamma+\frac{1}{2n}+O!\left(\frac1{n^2}\right),$
where $\gamma\approx0.57721$ is the Euler–Mascheroni constant. Thus $H_n\sim\ln n$: doubling or even multiplying $n$ enormously produces only modest increases in the sum. For example, $H_{10}\approx2.929$, illustrating just how slowly the divergence occurs.
The harmonic series appears throughout mathematics and computer science. Harmonic numbers arise in the block-stacking problem, where $n$ blocks can overhang a table by $\frac12H_n$ block lengths, in desert-crossing and fuel-depot problems, in probability problems such as the coupon collector problem, in number theory involving primes, and in the average-case analysis of algorithms such as quicksort. The series is therefore important not only as a basic example in mathematical analysis, but as a structure that repeatedly appears whenever increasingly small contributions accumulate over many stages.
Key takeaways
ARTICLE
The harmonic series is the infinite sum
$\displaystyle \sum_{n=1}^{\infty}\frac1n=1+\frac12+\frac13+\frac14+\cdots.$
Although its terms $\frac1n$ approach $0$, the series itself diverges: its partial sums grow without bound. This is one of the classic examples showing that the condition $a_n\to0$ is necessary but not sufficient for $\sum a_n$ to converge. A famous proof, essentially due to Nicole Oresme around 1350, groups the terms in blocks whose sizes double. Each block contributes at least $\frac12$, producing infinitely many such contributions. Divergence also follows from the integral test because $\displaystyle \int_1^\infty\frac{dx}{x}=\infty$.
The first $n$ terms form the harmonic number
$\displaystyle H_n=\sum_{k=1}^n\frac1k.$
Despite divergence, these partial sums grow extraordinarily slowly. Their asymptotic behaviour is
$\displaystyle H_n=\ln n+\gamma+\frac{1}{2n}+O!\left(\frac1{n^2}\right),$
where $\gamma\approx0.57721$ is the Euler–Mascheroni constant. Thus $H_n\sim\ln n$: doubling or even multiplying $n$ enormously produces only modest increases in the sum. For example, $H_{10}\approx2.929$, illustrating just how slowly the divergence occurs.
The harmonic series appears throughout mathematics and computer science. Harmonic numbers arise in the block-stacking problem, where $n$ blocks can overhang a table by $\frac12H_n$ block lengths, in desert-crossing and fuel-depot problems, in probability problems such as the coupon collector problem, in number theory involving primes, and in the average-case analysis of algorithms such as quicksort. The series is therefore important not only as a basic example in mathematical analysis, but as a structure that repeatedly appears whenever increasingly small contributions accumulate over many stages.
Key takeaways
- Terms tending to zero do not guarantee convergence: $\frac1n\to0$, yet $\sum 1/n$ diverges.
- The divergence is extremely slow, since $H_n\approx\ln n+\gamma$.
- Oresme's grouping argument gives a particularly elegant proof of divergence.
- Harmonic numbers appear naturally in analysis, number theory, probability, combinatorics and algorithms.
ARTICLE
┌────────────────────────────────┐
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘
│ KONSTANTINOS MICHAILIDIS │
└────────────────────────────────┘