Harmonic series (mathematics)


In mathematics, the harmonic series is the infinite series formed by summing all positive unit fractions:
The first terms of the series sum to approximately, where is the natural logarithm and is the Euler–Mascheroni constant. Because the logarithm has arbitrarily large values, the harmonic series does not have a finite limit: it is a divergent series. Its divergence was proven in the 14th century by Nicole Oresme using a precursor to the Cauchy condensation test for the convergence of infinite series. It can also be proven to diverge by comparing the sum to an integral, according to the integral test for convergence.
Applications of the harmonic series and its partial sums include Euler's proof that there are infinitely many prime numbers, the analysis of the coupon collector's problem on how many random trials are needed to provide a complete range of responses, the connected components of random graphs, the block-stacking problem on how far over the edge of a table a stack of blocks can be cantilevered, and the average case analysis of the quicksort algorithm.

History

The name of the harmonic series derives from the concept of overtones or harmonics in music: the wavelengths of the overtones of a vibrating string are etc., of the string's fundamental wavelength. Every term of the harmonic series after the first is the harmonic mean of the neighboring terms, so the terms form a harmonic progression; the phrases harmonic mean and harmonic progression likewise derive from music.
Beyond music, harmonic sequences have also had a certain popularity with architects. This was so particularly in the Baroque period, when architects used them to establish the proportions of floor plans, of elevations, and to establish harmonic relationships between both interior and exterior architectural details of churches and palaces.
The divergence of the harmonic series was first proven in 1350 by Nicole Oresme. Oresme's work, and the contemporaneous work of Richard Swineshead on a different series, marked the first appearance of infinite series other than the geometric series in mathematics. However, this achievement fell into obscurity. Additional proofs were published in the 17th century by Pietro Mengoli and by Jacob Bernoulli. Bernoulli credited his brother Johann Bernoulli for finding the proof, and it was later included in Johann Bernoulli's collected works.
The partial sums of the harmonic series were named harmonic numbers, and given their usual notation, in 1968 by Donald Knuth.

Definition and divergence

The harmonic series is the infinite series
in which the terms are all of the positive unit fractions. It is a divergent series: as more terms of the series are included in partial sums of the series, the values of these partial sums grow arbitrarily large, beyond any finite limit. Because it is a divergent series, it should be interpreted as a formal sum, an abstract mathematical expression combining the unit fractions, rather than as something that can be evaluated to a numeric value. There are many different proofs of the divergence of the harmonic series, surveyed in a 2006 paper by S. J. Kifowit and T. A. Stamps.
Two of the best-known are listed below.

Comparison test

One way to prove divergence is to compare the harmonic series with another divergent series, where each denominator is replaced with the next-largest power of two:
Grouping equal terms shows that the second series diverges :
Because each term of the harmonic series is greater than or equal to the corresponding term of the second series, and since the second series diverges, it follows that the harmonic series diverges as well. The same argument proves more strongly that, for every positive
This is the original proof given by Nicole Oresme in around 1350. The Cauchy condensation test is a generalization of this argument.

Integral test

It is possible to prove that the harmonic series diverges by comparing its sum with an improper integral. Specifically, consider the arrangement of rectangles shown in the figure to the right. Each rectangle is 1 unit wide and units high, so if the harmonic series converged then the total area of the rectangles would be the sum of the harmonic series. The curve stays entirely below the upper boundary of the rectangles, so the area under the curve would be less than the area of the union of the rectangles. However, the area under the curve is given by a divergent improper integral,
Because this integral does not converge, the sum cannot converge either.
In the figure to the right, shifting each rectangle to the left by 1 unit, would produce a sequence of rectangles whose boundary lies below the curve rather than above it.
This shows that the partial sums of the harmonic series differ from the integral by an amount that is bounded above and below by the unit area of the first rectangle:
Generalizing this argument, any infinite sum of values of a monotone decreasing positive function has partial sums that are within a bounded distance of the values of the corresponding integrals. Therefore, the sum converges if and only if the integral over the same range of the same function converges. When this equivalence is used to check the convergence of a sum by replacing it with an easier integral, it is known as the integral test for convergence.

Partial sums

Adding the first terms of the harmonic series produces a partial sum, called a harmonic number and

Growth rate

These numbers grow very slowly, with logarithmic growth, as can be seen from the integral test. More precisely, by the Euler–Maclaurin formula,
where is the Euler–Mascheroni constant and which approaches 0 as goes to infinity.

Divisibility

No harmonic numbers are integers except for One way to prove that is not an integer is to consider the highest power of two in the range from If is the least common multiple of the numbers from then
can be rewritten as a sum of fractions with equal denominators
in which only one of the numerators, is odd and the rest are even, and is itself even. Therefore, the result is a fraction with an odd numerator and an even denominator, which cannot be an integer. More generally, any sequence of consecutive integers has a unique member divisible by a greater power of two than all the other sequence members, from which it follows by the same argument that no two harmonic numbers differ by an integer.
Another proof that the harmonic numbers are not integers observes that the denominator of must be divisible by
all prime numbers greater than and less than or equal to, and uses Bertrand's postulate to prove that this set of primes is non-empty. The same argument implies more strongly that, except for,, and, no harmonic number can have a terminating decimal representation. It has been conjectured that every prime number divides the numerators of only a finite subset of the harmonic numbers, but this remains unproven.

Interpolation

The digamma function is defined as the logarithmic derivative of the gamma function
Just as the gamma function provides a continuous interpolation of the factorials, the digamma function provides a continuous interpolation of the harmonic numbers, in the sense that
This equation can be used to extend the definition to harmonic numbers with rational indices.

Applications

Many well-known mathematical problems have solutions involving the harmonic series and its partial sums.

Crossing a desert

The jeep problem or desert-crossing problem is included in a 9th-century problem collection by Alcuin, Propositiones ad Acuendos Juvenes, but with an incorrect solution. The problem asks how far into the desert a jeep can travel and return, starting from a base with loads of fuel, by carrying some of the fuel into the desert and leaving it in depots. The optimal solution involves placing depots spaced at distances from the starting point and each other, where is the range of distance that the jeep can travel with a single load of fuel. On each trip out and back from the base, the jeep places one more depot, refueling at the other depots along the way, and placing as much fuel as it can in the newly placed depot while still leaving enough for itself to return to the previous depots and the base. Therefore, the total distance reached on the th trip is
where is the harmonic number. The divergence of the harmonic series implies that crossings of any length are possible with enough fuel.
For instance, for Alcuin's version of the problem, : a camel can carry 30 measures of grain and can travel one leuca while eating a single measure, where a leuca is a unit of distance roughly equal to. The problem has : there are 90 measures of grain, enough to supply three trips. For the standard formulation of the desert-crossing problem, it would be possible for the camel to travel leucas and return, by placing a grain storage depot 5 leucas from the base on the first trip and 12.5 leucas from the base on the second trip. However, Alcuin instead asks a slightly different question, how much grain can be transported a distance of 30 leucas without a final return trip, and either strands some camels in the desert or fails to account for the amount of grain consumed by a camel on its return trips.

Stacking blocks

In the block-stacking problem, one must place a pile of identical rectangular blocks, one per layer, so that they hang as far as possible over the edge of a table without falling. The top block can be placed with of its length extending beyond the next lower block. If it is placed in this way, the next block down needs to be placed with at most of its length extending beyond the next lower block, so that the center of mass of the top two blocks is supported and they do not topple. The third block needs to be placed with at most of its length extending beyond the next lower block, so that the center of mass of the top three blocks is supported and they do not topple, and so on. In this way, it is possible to place the blocks in such a way that they extend lengths beyond the table, where is the harmonic number. The divergence of the harmonic series implies that there is no limit on how far beyond the table the block stack can extend. For stacks with one block per layer, no better solution is possible, but significantly more overhang can be achieved using stacks with more than one block per layer.