You are currently browsing the tag archive for the ‘Bernoulli’ tag.

As we discussed in the previous post, the Bernoulli brothers Johann and Jakob were both intrigued by the divergence of the harmonic series. Jakob in particular was fascinated by infinite series in general, and he turned his attention to a problem which had been posed by Pietro Mengoli in 1644.

*Find the exact sum (and not just an estimate) of the series *

In 1655, John Wallis, an English mathematician, had communicated that he had found the sum to three decimal places but he was unable to say anything more concrete. Jakob Bernoulli wrote about this problem in 1689 and it came to be known as the *Basel problem*, after the hometown of the Bernoullis as well as that of the eventual solver of the problem, Leonhard Euler. There’s a lot of literature available on this problem and some of what we say below is from William Dunham’s award-winning book titled *Euler: The master of us all *and the paper by Raymond Ayoub titled *Euler and the zeta function. *

It was known that the series converges but finding the exact sum proved to be remarkably difficult. Many prominent mathematicians, including Leibnitz, Mengoli and the Bernoullis brothers had tried their hand at solving it but had failed. Indeed, after growing increasingly frustrated with his failure, Jakob said the following about this problem [Dunham]:

*“If anyone finds and communicates to us that which thusfar has eluded our efforts, great will be our gratitude”*

In 1721, a young Euler began studying mathematics under the mentorship of Jakob’s younger brother Johann Bernoulli (who was one of the most prominent mathematicians of the world at that time). In all probability, it was Johann who first told Euler about the Basel problem but it is unclear exactly when he did so. Nonetheless, by 1728 Euler had started working on the problem. It was around the same time when Daniel Bernoulli (Johann’s son) wrote to Christian Goldbach that he had found an approximate value of the sum of the series (the value he gave was ). Goldbach replied that he had found that the sum is between and . One of Euler’s earliest attempts was to find numerical approximations of some of the partial sums of the series but these were not too helpful. Indeed, the sum of the first thousand terms is but this is only accurate up to the first two digits (the problem being that the series converges very slowly).

We now discuss Euler’s solution to the Basel problem.

**Theorem (Euler, 1734)** *.*

This is truly a remarkable result and anyone who sees it for the first time cannot help but be amazed. Euler’s proof is a shining example of his ingenuity and mathematical prowess. In order to prove the result he used the well-known series expansion for :

Next, he considered the “infinite polynomial”

and observed that for . Now, the roots of the polynomial are given by all such that (and . This gives us and this means that for each , there are two roots. Using this observation, Euler factored as follows:

The next step illustrates Euler’s foresight and his genius, for he expanded the right-hand side as follows

where the remaining terms in the expansion on the right are not relevant to the problem at hand. Euler then compared the coefficients of in the above equation to get

which gave him the celebrated solution to the Basel problem. This was a triumphant moment for Euler and it truly established his reputation as the foremost mathematician at that time. While the general reaction on the result was that of amazement, a few remained skeptical. In his proof Euler had performed manipulations on infinite series considering them as polynomials and Daniel Bernoulli objected to this approach. Euler himself was less convinced about the rigor of the method so he devised other proofs justifying the formula. He also looked at the $p$-series for .

These ideas were used by Bernhard Riemann in the 19th century in studying the Riemann-zeta function

in connection with his investigation of the distribution of primes. In this notation, the solution of the Basel problem reads as . Remarkably enough, in 1740 Euler gave a more general formula for calculating if is an integer:

where are the Bernoulli numbers.

Since then a number of modern proofs have popped up. A nice summary of some of the available proofs is given by Robin Chapman in his article titled Evaluating . Interestingly, while we know the sum of the -series when is positive and even, not a lot is known about the sum of the series when is odd. As far as I know, there is no exact formula for .

In this post we look at the harmonic series

Students often have difficulty coming to grips with this fact that this series diverges when they encounter it in an elementary calculus course. The result may seem somewhat counter-intuitive at first, since as gets larger, only very small terms get added to the existing sum. The harmonic series serves as an example of a divergent series whose term tends to zero, thus justifying the statement that the converse of the following theorem does not hold in general.

**Theorem** *If a series converges then *.

How do we show that the harmonic series diverges? One of the standard proofs presented in many textbooks goes like this.

Let be the -th partial sum. Observe that

and in general,

This implies that and hence the harmonic series diverges (why?). This proof (which was given by Oresme around 1350) is fairly simple and easy to understand by most students and it makes you wonder if there are any other proofs out there which are more “hands on” and which only use techniques that first-year calculus students can understand. It turns out that there are at least thirty-nine proofs of the divergence of the harmonic series which can be found in the excellent article by Kifowit and Stamps titled The Harmonic Series Diverges Again and Again and by Kifowit titled More Proofs of the Divergence of Harmonic Series.

**A proof by Johann Bernoulli
**

In this section we will discuss a remarkable proof of the divergence of the harmonic series which first appeared in the work of Jakob Bernoulli who generously attributed it to his brother Johann Bernoulli. For a fascinating account of the history behind this proof and more, please look at the following article:

William Dunham, *The Bernoullis and the harmonic series*, College Mathematics Journal, 18 (1987), 18-23.

Before looking at Bernoulli’s proof, let’s put things in perspective a little bit. The proof was devised around 150 years before the concept of convergence of series was made precise (by Cauchy) via the notion of convergence of partial sums. It is therefore understandable that Bernoulli looked at infinite series in a somewhat “naive” way (at least compared to the modern notion of convergence of a series). Nonetheless, the proof is quite refreshing and ingenious because it is based on, strangely enough, the convergence of the series . In what follows, we present a modern version of Bernoulli’s proof given in the aforementioned article by Kifowit and Stamps.

The series

is a convergent telescoping series whose sum is 1. In a similar manner, it can be shown that for . Bernoulli’s proof is by contradiction. Suppose that the harmonic series converges and suppose that its sum is . Then,

This final statement is a contradiction. Thus the harmonic series diverges.