Newtonpedia ES
Home › Mathematics › Bernoulli number
Bernoulli number
Image: Wikimedia Commons
Mathematics · 1710

Bernoulli number

A sequence of rational numbers that arises when summing powers of natural numbers and plays a major role in number theory and analysis.

Year
1710
People involved
Jacob Bernoulli, Takakazu Seki
Section
Mathematics

History

Bernoulli numbers grew out of an old problem: finding the sum of the first natural numbers, and of their squares, cubes and higher powers. For centuries these sums were described in words or in tables, without a general formula. Summing the natural numbers raised to a fixed power always gives a polynomial in n, but the coefficients of these polynomials did not seem to follow a common rule. Mathematicians from antiquity, including Pythagoras and Archimedes, studied the question, and in the sixteenth and seventeenth centuries Thomas Harriot, Johann Faulhaber, Pierre de Fermat and Blaise Pascal made important progress.

The decisive step came from the Swiss mathematician Jacob Bernoulli, who realized that a single sequence of constants could give a uniform formula for the sum of any power. He was so pleased with his method that he remarked it had taken him less than a quarter of an hour to work out the sum of the tenth powers of the first thousand numbers. His results appeared posthumously in Ars Conjectandi in 1713. The Japanese mathematician Seki Takakazu reached equivalent results independently, and his work was published in 1712, also after his death, although he did not present them as a formula based on a sequence of constants. The name Bernoulli numbers for these coefficients was later proposed by Abraham de Moivre. The formula is sometimes called Faulhaber's formula, although Faulhaber never stated it in this form.

The idea can be seen in a simple case. For the sum of the first natural numbers, Bernoulli's formula gives (n² + n)/2, a result known since antiquity. The numbers themselves can be computed with a recursive rule, in which each value depends on the earlier ones, or through a generating function, a series whose coefficients are exactly these numbers. The literature uses two sign conventions, which differ only in the value of B₁, and all odd-index numbers beyond the first are zero.

In the nineteenth century Ada Lovelace described, in her notes on Charles Babbage's Analytical Engine, an algorithm for generating them. It is disputed whether the method was her own or Babbage's, but it is often regarded as the first published computer program. Later, Ernst Kummer found that these numbers are linked to Fermat's Last Theorem, and they became connected to the Riemann zeta function, to divisibility questions and to fields such as cyclotomic fields and algebraic K-theory. Today they appear in mathematical analysis, in series expansions of trigonometric functions, in the Euler-Maclaurin formula and in many calculations in physics and computing.

Timeline

  • 1631Johann Faulhaber publishes formulas for sums of powers up to the seventeenth, without a general formula.
  • 1654Blaise Pascal proves an identity related to sums of powers of the first natural numbers.
  • 1712Seki Takakazu posthumously publishes his independent discovery in Katsuyō Sanpō.
  • 1713Jacob Bernoulli posthumously publishes his general formula in Ars Conjectandi.
  • 1843Ada Lovelace publishes in her notes on the Analytical Engine an algorithm for generating these numbers.
  • Ernst Kummer links their divisibility properties to Fermat's Last Theorem.

Trivia and anecdotes

A memorable calculation

Bernoulli claimed he found the sum of the tenth powers of the first thousand numbers in less than a quarter of an hour, thanks to his table of coefficients.

The first published program

Ada Lovelace's algorithm for generating these numbers is regarded as the first published computer program, although it is debated whether the idea was hers or Babbage's.

People involved

Other milestones in Mathematics