The harmonic series is the infinite series
Although its terms approach zero, its partial sums increase without bound, so the series diverges to positive infinity. It is a fundamental example in mathematical analysis demonstrating that terms tending to zero are necessary, but not sufficient, for convergence. Its partial sums, called harmonic numbers, grow approximately as the natural logarithm of the number of terms.
Definition and terminology
The th harmonic number is
The harmonic series converges only if the sequence has a finite limit. Instead,
Writing that the series “equals infinity” is therefore shorthand for divergence to positive infinity, not an assertion that infinity is a real-valued sum.
The word harmonic reflects a connection with musical harmonics: the wavelengths of successive harmonics of an ideal vibrating string are proportional to . The reciprocal integers also form a harmonic progression, meaning that their reciprocals form an arithmetic progression. This numerical series should not be confused with a Fourier series, which represents a function through trigonometric components.
Why the series diverges
Grouping terms
A classical proof groups terms into blocks of successively doubled length:
For each integer , the block from to contains terms, each at least . Consequently,
Thus
The right-hand side grows without bound. Since every term is positive, all sufficiently long partial sums—not merely those indexed by powers of two—exceed any prescribed finite bound.
This argument is commonly associated with the fourteenth-century mathematician Nicole Oresme. It is an early and influential example of a proof about an infinite process using finite inequalities.
Integral comparison
The function is positive and decreasing for . Comparing rectangles with the area beneath its graph gives
Using the natural logarithm,
Since is unbounded, the harmonic series diverges.
These inequalities are an application of the integral test for series. They also show that the divergence is logarithmic rather than linear.
Failure of the Cauchy criterion
For every positive integer ,
Hence arbitrarily late partial sums can still differ by at least . The partial sums do not form a Cauchy sequence, so they cannot converge in the real numbers.
This formulation identifies the essential issue: individual terms become small, but sufficiently long blocks of them retain a substantial total.
Rate of growth and Euler's constant
The integral bounds imply
A more precise result is that the difference approaches the Euler–Mascheroni constant:
The limit exists because is decreasing and bounded below. In particular,
while the integral bounds give a lower bound of zero.
An asymptotic expansion gives greater precision:
where big-O notation describes the size of the remainder as grows.
The logarithmic growth is extremely slow. For example,
For a large target value , the number of terms needed for the partial sum to reach approximately is
Thus a modest increase in the desired partial sum requires a large multiplicative increase in the number of terms.
A related limit is
Doubling the number of terms eventually adds approximately the same amount each time.
Related series
Generalized harmonic series
The generalized harmonic series, or -series, is
where is real. It converges exactly when .
For , convergence follows from comparison with the improper integral of . For , its terms are at least , so the series diverges. The harmonic series is therefore the boundary case between convergence and divergence in this family.
For a complex variable with real part greater than , the same expression defines the Riemann zeta function:
Its analytic continuation has a simple pole at , with local expansion
This pole is closely connected to the divergence of the harmonic series. Analytic continuation does not give the original series a finite ordinary sum.
Alternating harmonic series
Changing the signs of alternate terms produces the alternating harmonic series:
It converges because the term magnitudes decrease to zero. Its sum can be obtained by integrating the finite geometric identity
over , then observing that the integrated remainder tends to zero.
Its absolute-value series is the divergent harmonic series, so its convergence is conditional rather than absolute. This distinction matters: rearranging the terms of a conditionally convergent real series can change its sum or cause divergence.
Subseries and restrictions on denominators
Some subseries of the harmonic series converge, while others diverge.
Restricting the denominator to powers of two gives the convergent geometric series
Restricting it to positive even integers gives
which still diverges. More generally, reciprocals along any fixed arithmetic progression of positive integers have a divergent sum.
A deeper result in number theory, established by Leonhard Euler, is that
also diverges, despite the increasing sparsity of the prime numbers.
Applications
Probability and the coupon collector problem
In the coupon collector problem, independent draws select uniformly from possible types. The expected number of draws required to observe every type is
After distinct types have appeared, the probability that the next draw produces a new type is . The expected waiting time for the next new type is therefore . Adding these waiting times gives
The expected value consequently grows as
Algorithms
Harmonic sums occur in the analysis of an algorithm whenever the work or probability associated with its th stage is proportional to .
For example, in a uniformly random ordering of distinct values, the probability that the th value is larger than every preceding value is . By linearity of expectation, the expected number of such record values is , and therefore grows logarithmically.
Idealized block stacking
In an idealized stack of identical uniform blocks, with static balance and no limit on material strength, each additional block permits an incremental overhang inversely proportional to its position in the balancing construction. For blocks of length , the standard construction gives an overhang
beyond the edge of the support.
The divergence of means that this idealized construction permits arbitrarily large overhang using sufficiently many blocks. Real materials and finite precision impose practical restrictions absent from the model.
Computational considerations
Because the divergence is so slow, numerical experiments over a limited range can obscure it. Conversely, a very large finite partial sum remains finite and does not itself establish divergence.
Direct summation is also subject to floating-point rounding. At sufficiently large indices, adding to a stored partial sum may no longer change that stored value, even though the exact partial sum increases. Such numerical stagnation is an artifact of finite precision, not evidence of convergence. For large , logarithmic approximations with correction terms provide a more efficient way to estimate than adding every term.