Misplaced Pages

Revision as of 10:09, 17 July 2009

In mathematics, the Bernoulli numbers are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers.

In Europe, they were first studied by Jakob Bernoulli. They appear in the Taylor series expansions of the tangent and hyperbolic tangent functions, in the Euler–Maclaurin formula, and in expressions for certain values of the Riemann zeta function.

In note G of Ada Lovelace's notes on the Analytical engine from 1842, Lovelace describes an algorithm for generating Bernoulli numbers with Babbage's machine . As a result, the Bernoulli numbers have the distinction of being the subject of the first computer program.

Introduction

The Bernoulli numbers are rooted in the early history of the computation of sums of integer powers, which have been of interest to mathematicians since antiquity.

Methods to calculate the sum of the first n positive integers, the sum of the squares and of the cubes of the first n positive integers were known, but there were no real 'formulas', only descriptions given entirely in words. Among the great mathematicians of antiquity which considered this problem were: Pythagoras (c. 572-497 BCE, Greece), Archimedes ((287-212 BCE, Italy), Aryabhata (b. 476, India), Abu Bakr al-Karaji (d. 1019, Persia) and Abu Ali al-Hasan ibn al-Hasan ibn al-Haytham (965-1039, Egypt).

Only during the late sixteenth and early seventeenth centuries mathematicians made progress. In the West Thomas Harriot (1560-1621) of England, Johann Faulhaber (1580-1635) of Germany, Pierre de Fermat (1601-1665) and fellow French mathematician Blaise Pascal (1623-1662) played an important role in this development.

Thomas Harriot seems to have been the first to derive and write formulas for sums of powers using symbolic notation, but even he calculated only up to the sum of the fourth powers. Johann Faulhaber gave formulas for sums of powers up to the 17th power in his 1631 Academia Algebrae, far higher than anyone before him, but he did not give a general formula.

The Swiss mathematician Jakob Bernoulli (1654-1705) was the first to realize the existence of a single sequence of constants B₀, B₁, B₂,... which provide a uniform formula for all sums of powers (Knuth 1993). At approximately the same time in Japan an equivalent method for calculating sums of powers was discovered by Seki Kowa. However, Seki did not present his method as a formula based on a sequence of constants.

The joy Bernoulli experienced when he hit upon the pattern needed to compute quickly and easily the coefficients of his formula for the sum of the c-th powers for any positive integer c can be seen from his comment. He wrote:

“With the help of this table, it took me less than half of a quarter of an hour to find that the tenth powers of the first 1000 numbers being added together will yield the sum
91,409,924,241,424,243,424,241,924,242,500.”

Bernoulli's formula for sums of powers is the most useful and generalizable formulation to date. The coefficients in Bernoulli's formula are nowadays called Bernoulli numbers, following a suggestion of Abraham de Moivre.

Reconstruction of 'Summae Potestatum'

The Bernoulli numbers were introduced by Jakob Bernoulli in the book 'Ars Conjectandi' published posthumously in 1713. The main formula can be seen in the second half of the facsimile given above. The constant coefficients denoted A, B, C and D by Bernoulli are mapped to the notation which is now prevalent as A = B₂, B = B₄, C = B₆, D = B₈. In the expression c·c−1·c−2·c−3 the small dots are used as grouping symbols, not as signs for multiplication. Using today's terminology these expressions are falling factorial powers ${\displaystyle c^{\underline {k}}}$. The factorial notation k! as a shortcut for 1×2×...×k was not introduced until 100 years later. The integral symbol on the left hand side goes back to Gottfried Wilhelm Leibniz in 1675 who used it as a long letter S for "summa" (sum). (The Mathematics Genealogy Project shows Leibniz as the doctoral adviser of Jakob Bernoulli. See also the Earliest Uses of Symbols of Calculus .) The letter n on the left hand side is not an index of summation but gives the upper limit of the range of summation which is to be understood as 1,2,...,n. Putting things together, for positive c, today a mathematician is likely to write Bernoulli's formula as

${\displaystyle \sum _{0<k\leq n}k^{c}={\frac {n^{c+1}}{c+1}}+{\frac {1}{2}}n^{c}+\sum _{k\geq 2}{\frac {B_{k}}{k!}}c^{\underline {k-1}}n^{c-k+1}\ .}$

In fact this formula imperatively suggests to set B₁ = 1/2 when switching from the so called 'archaic' enumeration which uses only the even indices 2,4,.. to the modern form (more on different conventions in the next paragraph). Most striking in this context is the fact that the falling factorial ${\displaystyle c^{\underline {k-1}}}$ has for k = 0 the value 1/(c + 1). (See the explanation in .) Thus Bernoulli's formula can and has to be written

${\displaystyle \sum _{0<k\leq n}k^{c}=\sum _{k\geq 0}{\frac {B_{k}}{k!}}c^{\underline {k-1}}n^{c-k+1}\ .}$

if B₁ stands for the value Bernoulli himself has given to the coefficient at that position.

Sum of powers

Bernoulli's Formula

Closed forms of the sum of powers for fixed values of m

${\displaystyle \ \ S_{m}(n)=\sum _{k=1}^{n}k^{m}=1^{m}+2^{m}+\cdots +{n}^{m}\ \ }$

are always polynomials in n of degree m + 1. Note that S_m(0) = 0 for all m ≥ 0 because in this case the sum is the empty sum. The coefficients of these polynomials are related to the Bernoulli numbers by Bernoulli's formula:

${\displaystyle S_{m}(n)={1 \over {m+1}}\sum _{k=0}^{m}{m+1 \choose {k}}B_{k}n^{m+1-k}}$

Let n ≥ 0. Taking m to be 0 and B₀ = 1 gives the natural number 0,1,2,3,… (sequence OEIS: A001477).

${\displaystyle 0+1+1+\cdots +1={\frac {1}{1}}\left(B_{0}n\right)=n.}$

Taking m to be 1 and B₁ = 1/2 gives the triangular number 0,1,3,6,… (sequence OEIS: A000217).

${\displaystyle 0+1+2+\cdots +n={\frac {1}{2}}\left(B_{0}n^{2}+2B_{1}n^{1}\right)={\frac {1}{2}}\left(n^{2}+n\right).}$

Taking m to be 2 and B₂ = 1/6 gives the square pyramidal number 0,1,5,14,… (sequence OEIS: A000330).

${\displaystyle 0^{2}+1^{2}+2^{2}+\cdots +n^{2}={\frac {1}{3}}\left(B_{0}n^{3}+3B_{1}n^{2}+3B_{2}n^{1}\right)={\frac {1}{3}}\left(n^{3}+{\frac {3}{2}}n^{2}+{\frac {1}{2}}n\right).}$

Although Bernoulli's formula reflects faithfully what Bernoulli has written some authors state Bernoulli's formula in a different way which is neither in accordance with Bernoulli's statement nor has any obvious advantage compared to it. They write:

${\displaystyle S_{m}(n)={1 \over {m+1}}\sum _{k=0}^{m}(-1)^{k}{m+1 \choose {k}}B_{k}n^{m+1-k}}$

To avoid a contradiction to the valid formula above these authors have to set B₁ = -1/2. In the next section consequences of the resulting differences will be commented on as they are likely to produce some confusion.

Faulhaber's Formula

Bernoulli's formula is sometimes called Faulhaber's formula. There is no evidence which justifies this nomenclature. Johann Faulhaber found remarkable ways to calculate sum of powers but he never stated Bernoulli's formula.

Faulhaber realized that for odd m, S_m(n) is not just a polynomial in n but a polynomial in the triangular number N = n(n + 1)/2. For example Faulhaber's formulas read as follows:

${\displaystyle 1+2+\cdots +n=N;}$

${\displaystyle 1^{2}+2^{2}+\cdots +n^{2}=N\left(2n+1\right)/3;}$

${\displaystyle 1^{3}+2^{3}+\cdots +n^{3}=N^{2}.}$

To call Bernoulli's formula Faulhaber's formula does injustice to Bernoulli and simultaneously hides the genius of Faulhaber as Faulhaber's formula is in fact more efficient than Bernoulli's formula. According to Knuth (Knuth 1993) a rigorous proof of Faulhaber’s formula was first published by Carl Jacobi in 1834 (Jacobi 1834). Donald E. Knuth's in-depth study of Faulhaber's Formula concludes:

“Faulhaber never discovered the Bernoulli numbers; i.e., he never realized that a single sequence of constants B₀, B₁, B₂, … would provide a uniform

${\displaystyle \quad \sum n^{m}={\frac {1}{m+1}}\left(B_{0}n^{m+1}-{\binom {m+1}{1}}B_{1}n^{m}+{\binom {m+1}{2}}B_{2}n^{m-1}-\cdots +(-1)^{m}{\binom {m+1}{m}}B_{m}n\right)}$

for all sums of powers. He never mentioned, for example, the fact that almost half of the coefficients turned out to be zero after he had converted his formulas for ${\displaystyle \sum n^{m}}$ from polynomials in N to polynomials in n.” (Knuth 1993, p. 14)

Faulhaber's formula was generalized by V. Guo and J. Zeng to a q-analog (Guo & Zeng 2005).

Definitions

Many characterizations of the Bernoulli numbers have been found in the last 300 years, and each could be used to introduce theses numbers. Here only four of the most useful ones are mentioned:

• a recursive equation,
• an explicit formula,
• a generating function,
• an algorithmic description.

For the proof of the equivalence of the four approaches the reader is referred to mathematical expositions like (Ireland & Rosen 1990) or (Conway & Guy 1996).

Unfortunately in the literature the definition is given in two variants: Despite the fact, that Bernoulli defined B₁ = 1/2 some authors set B₁ = —1/2 (more on different conventions below). In order to prevent potential confusions both variants will be described here, side by side.

Recursive definition

The recursive equation is best introduced in a slightly more general form

${\displaystyle B_{m}(n)=n^{m}-\sum _{k=0}^{m-1}{\binom {m}{k}}{\frac {B_{k}(n)}{m-k+1}}\ .}$

This equation defines integers B_m(n) for all integers n ≥ 0, m ≥ 0. 0 has to be interpreted as 1. The recursion has its base in B₀(n) = 1 for all n. The two variants now follow by setting n = 0 respectively n = 1. Additionally the notation is simplified by erasing the reference to the parameter n.

n = 0	n = 1
${\displaystyle B_{m}=\left-\sum _{k=0}^{m-1}{\binom {m}{k}}{\frac {B_{k}}{m-k+1}}}$	${\displaystyle B_{m}=1-\sum _{k=0}^{m-1}{\binom {m}{k}}{\frac {B_{k}}{m-k+1}}}$

Here the expression has the value 1 if m = 0 and 0 otherwise (Iverson bracket). Whenever a confusion between the two kinds of definitions might arise it can be avoided by refering to the more general definition and by reintroducing the erased parameter: writing B_m(0) in the first case and B_m(1) in the second will unambiguously denote the value in question.

Explicit definition

Starting again with a slightly more general formula

${\displaystyle B_{m}(n)=\sum _{k=0}^{m}\sum _{v=0}^{k}(-1)^{v}{\binom {k}{v}}{\frac {\left(n+v\right)^{m}}{k+1}},}$

the choices n = 0 and n = 1 lead to

n = 0	n = 1
${\displaystyle B_{m}=\sum _{k=0}^{m}\sum _{v=0}^{k}(-1)^{v}{\binom {k}{v}}{\frac {v^{m}}{k+1}}\ ,}$	${\displaystyle B_{m}=\sum _{k=1}^{m+1}\sum _{v=1}^{k+1}(-1)^{v+1}{\binom {k-1}{v-1}}{\frac {v^{m}}{k}}\ .}$

There is a widespread misinformation that no simple closed formulas for the Bernoulli numbers exist. The last two equations show that this is not true. Moreover, already in 1893 Louis Saalschütz listed a total of 38 explicit formulas for the Bernoulli numbers (Saalschütz 1893), usually giving some reference in the older literature.

Generating function

The general formula for the generating function is

${\displaystyle {\frac {te^{nt}}{e^{t}-1}}=\sum _{m=0}^{\infty }B_{m}(n){\frac {t^{m}}{m!}}\ .}$

The choices n = 0 and n = 1 lead to

n = 0	n = 1
${\displaystyle {\frac {t}{e^{t}-1}}=\sum _{m=0}^{\infty }B_{m}{\frac {t^{m}}{m!}}\ ,}$	${\displaystyle {\frac {t}{1-e^{-t}}}=\sum _{m=0}^{\infty }B_{m}{\frac {t^{m}}{m!}}\ .}$

Algorithmic description

Although the above recursive formula can be used for computation it is mainly used to establish the connection with the sum of powers because it is computationally expensive. However, both simple and high-end algorithms for computing Bernoulli numbers exist. A simple one is given in pseudo code below in the text box 'Akiyama-Tanigawa algorithm' and pointers to high-end algorithms are given in another section below.

Values of the Bernoulli numbers

B_n = 0 for all odd n other than 1. B₁ = 1/2 or −1/2 depending on the convention adopted (see below). The first few non-zero Bernoulli numbers (sequences OEIS: A027641 and OEIS: A027642 in OEIS) are listed below.

Efficient computation of Bernoulli numbers

In some applications it is useful to be able to compute the Bernoulli numbers B₀ through B_p − 3 modulo p, where p is a prime; for example to test whether Vandiver's conjecture holds for p, or even just to determine whether p is an irregular prime. It is not feasible to carry out such a computation using the above recursive formulae, since at least (a constant multiple of) p arithmetic operations would be required. Fortunately, faster methods have been developed (Buhler et al. 2001) which require only O(p (log p)) operations (see big-O notation).

David Harvey (Harvey 2008) describes an algorithm for computing Bernoulli numbers by computing B_n modulo p for many small primes p, and then reconstructing B_n via the Chinese Remainder Theorem. Harvey writes that the asymptotic time complexity of this algorithm is O(n log(n)) and claims that this implementation is significantly faster than implementations based on other methods. Harvey's implementation is included in Sage since version 3.1. Using this implementation Harvey computed B_n for n = 10, which is a new record (October 2008). Prior to that Bernd Kellner (Kellner 2002) computed B_n to full precision for n = 10 on December 2002 and Oleksandr Pavlyk (Pavlyk 2008) for n = 10 with 'Mathematica' on April 2008.

Digits is to be understood as the exponent of 10 when B(n) is written as a real in normalized scientific notation.

Different viewpoints and conventions

The Bernoulli numbers can be regarded from four main viewpoints:

• as standalone arithmetical objects,
• as combinatorial objects,
• as values of a sequence of certain polynomials,
• as values of the Riemann zeta function.

Each of these viewpoints leads to a set of more or less different conventions.

• Bernoulli numbers as standalone arithmetical objects.
  Associated sequence: 1/6, −1/30, 1/42, −1/30,...
  This is the viewpoint of Jakob Bernoulli. (See the cutout from his Ars Conjectandi, first edition, 1713). The Bernoulli numbers are understood as numbers, recursive in nature, invented to solve a certain arithmetical problem, the summation of powers, which is the paradigmatic application of the Bernoulli numbers. It is misleading to call this viewpoint 'archaic'. For example Jean-Pierre Serre uses it in his highly acclaimed book A Course in Arithmetic which is a standard textbook used at many universities today.
• Bernoulli numbers as combinatorial objects.
  Associated sequence: 1, +1/2, 1/6, 0,....
  This view focuses on the connection between Stirling numbers and Bernoulli numbers and arises naturally in the calculus of finite differences. In its most general and compact form this connection is summarized by the definition of the Stirling polynomials σ_n(x), formula (6.52) in Concrete Mathematics by Graham, Knuth and Patashnik.

  ${\displaystyle \left({\frac {ze^{z}}{e^{z}-1}}\right)^{x}=x\sum _{n\geq 0}\sigma _{n}(x)z^{n}}$

  In consequence B_n = n! σ_n(1) for n ≥ 0.
• Bernoulli numbers as values of a sequence of certain polynomials.
  Assuming the Bernoulli polynomials as already introduced the Bernoulli numbers can be defined in two different ways:
  B_n = B_n(0). Associated sequence: 1, −1/2, 1/6, 0,....
  B_n = B_n(1). Associated sequence: 1, +1/2, 1/6, 0,....
  The two definitions differ only in the sign of B₁. The choice B_n = B_n(0) is the convention used in the Handbook of Mathematical Functions.
• Bernoulli numbers as values of the Riemann zeta function.
  Associated sequence: 1, +1/2, 1/6, 0,....
  

  

  This convention agrees with the convention B_n = B_n(1) (for example J. Neukirch and M. Kaneko). The sign '+' for B₁ matches the representation of the Bernoulli numbers by the Riemann zeta function. In fact the identity nζ(1−n) = (−1)B_n valid for all n > 0 is then replaced by the simpler nζ(1−n) = -B_n. (See the paper of S. C. Woon.)
  (Note that in the foregoing equation for n = 0 and n = 1 the expression −nζ(1 − n) is to be understood as lim_x → n −xζ(1 − x).)

${\displaystyle \ B_{n}=n!\sigma _{n}(1)=B_{n}(1)=-n\zeta (1-n)\quad (n\geq 0)\ }$

Application of the Bernoulli numbers

Arguably the most important application of the Bernoulli number in mathematics is their use in the Euler–MacLaurin formula. Assuming that ƒ is a sufficiently often differentiable function the Euler–MacLaurin formula can be written as

${\displaystyle \sum \limits _{a\leq k<b}f(k)=\int _{a}^{b}f(x)\,dx\ +\sum \limits _{k=1}^{m}{\frac {B_{k}}{k!}}\left(f^{(k-1)}(b)-f^{(k-1)}(a)\right)+R(f,m)\ .}$

This formulation assumes the convention B₁ = −1/2. However, if one sets B₁ = 1/2 then this formula can also be written as

${\displaystyle \sum \limits _{a<k\leq b}f(k)=\int _{a}^{b}f(x)\,dx+\sum \limits _{k=1}^{m}{\frac {B_{k}}{k!}}\left(f^{(k-1)}(b)-f^{(k-1)}(a)\right)+R(f,m).\ }$

Here ƒ = ƒ which is a commonly used notation identifying the zero-th derivative of ƒ with ƒ. Moreover, let ƒ denote an antiderivative of ƒ. By the fundamental theorem of calculus,

${\displaystyle \int _{a}^{b}f(x)\,dx\ =f^{(-1)}(b)-f^{(-1)}(a).}$

Thus the last formula can be further simplified to the following succinct form of the Euler–Maclaurin formula

${\displaystyle \sum \limits _{a<k\leq b}f(k)=\sum \limits _{k=0}^{m}{\frac {B_{k}}{k!}}\left(f^{(k-1)}(b)-f^{(k-1)}(a)\right)+R(f,m).\ }$

This form is for example the source for the important Euler–MacLaurin expansion of the zeta function (B₁ = 1/2)

${\displaystyle {\begin{aligned}\zeta (s)&=\sum _{k=0}^{m}{\frac {B_{k}}{k!}}s^{\overline {k-1}}+R(s,m)\\&={\frac {B_{0}}{0!}}s^{\overline {-1}}+{\frac {B_{1}}{1!}}s^{\overline {0}}+{\frac {B_{2}}{2!}}s^{\overline {1}}+\cdots +R(s,m)\\&={\frac {1}{s-1}}+{\frac {1}{2}}+{\frac {1}{12}}s+\cdots +R(s,m).\end{aligned}}}$

Here ${\displaystyle s^{\overline {k}}}$ denotes the rising factorial power.

Bernoulli numbers are also frequently used in other kinds of asymptotic expansions. The following example is the classical Poincaré-type asymptotic expansion of the digamma function (again B₁ = 1/2).

${\displaystyle \psi (z)\sim \ln z-\sum _{k=1}^{\infty }{\frac {B_{k}}{kz^{k}}}}$

Combinatorial definitions

The connection of the Bernoulli number to various kinds of combinatorial numbers is based on the classical theory of finite differences and on the combinatorial interpretation of the Bernoulli numbers as an instance of a fundamental combinatorial principle, the inclusion-exclusion principle.

Connection with the Worpitzky number

The definition to proceed with was developed by Julius Worpitzky in 1883. Besides elementary arithmetic only the factorial function n! and the power function k is employed. The signless Worpitzky numbers are defined as

${\displaystyle W_{n,k}=\sum _{v=0}^{k}(-1)^{v+k}\left(v+1\right)^{n}{\frac {k!}{v!(k-v)!}}\ .}$

They can also be expressed through the Stirling set number

${\displaystyle W_{n,k}=k!\left\{{\begin{matrix}n+1\\k+1\end{matrix}}\right\}.}$

A Bernoulli number is then introduced as an inclusion-exclusion sum of Worpitzky numbers weighted by the sequence 1, 1/2, 1/3,...

${\displaystyle B_{n}=\sum _{k=0}^{n}(-1)^{k}{\frac {W_{n,k}}{k+1}}\ =\ \sum _{k=0}^{n}{\frac {1}{k+1}}\sum _{v=0}^{k}(-1)^{v}{k \choose v}\left(v+1\right)^{n}\ .}$

This representation has B₁ = 1/2.

A second formula representing the Bernoulli numbers by the Worpitzky numbers is for n ≥ 1

${\displaystyle B_{n}={\frac {n}{2^{n+1}-2}}\sum _{k=0}^{n-1}(-2)^{-k}\;W_{n-1,k}\ .}$

Connection with the Stirling set number

A similar combinatorial representation derives from

${\displaystyle B_{n}=\sum _{k=0}^{n}(-1)^{k+n}{\frac {k!}{k+1}}\left\{{\begin{matrix}n\\k\end{matrix}}\right\}\ .}$

Here the Bernoulli numbers are an inclusion-exclusion over the set of length-n words, where the sum is taken over all words of length n with k distinct letters, and normalized by k + 1. The combinatorics of this representation can be seen from:

${\displaystyle B_{0}=+\left\vert \ \left\{\varnothing \right\}\ \right\vert }$

${\displaystyle B_{1}=-{\frac {1}{1}}\left\vert \ \varnothing \ \right\vert +{\frac {1}{2}}\left\vert \left\{a\right\}\right\vert }$

${\displaystyle B_{2}=+{\frac {1}{1}}\left\vert \ \varnothing \ \right\vert -{\frac {1}{2}}\left\vert \left\{aa\right\}\right\vert +{\frac {1}{3}}\left\vert \left\{ab,ba\right\}\right\vert }$

${\displaystyle B_{3}=-{\frac {1}{1}}\left\vert \ \varnothing \ \right\vert +{\frac {1}{2}}\left\vert \left\{aaa\right\}\right\vert -{\frac {1}{3}}\left\vert \left\{aab,aba,baa,abb,bab,bba\right\}\right\vert +{\frac {1}{4}}\left\vert \left\{abc,acb,bac,bca,cab,cba\right\}\right\vert }$

Connection with the Stirling cycle number

Let ${\displaystyle \left}$ denote the signless Stirling cycle number. The two main formulas relating these number to the Bernoulli number (B₁ = 1/2) are

${\displaystyle {\frac {1}{m!}}\sum _{k=0}^{m}(-1)^{k}\leftB_{k}={\frac {1}{m+1}}\ ,}$

and the inversion of this sum (for n ≥ 0, m ≥ 0)

${\displaystyle {\frac {1}{m!}}\sum _{k=0}^{m}(-1)^{k}\leftB_{n+k}=A_{n,m}\ .}$

Here the number A_n,m are the rational Akiyama-Tanigawa number, the first few of which are displayed in the following table.

These relations lead to a simple algorithm to compute the Bernoulli number. The input is the first row, A_0,m = 1/(m + 1) and the output are the Bernoulli number in the first column A_n,0 = B_n . This transformation is shown in pseudo-code below.

Connection with the Eulerian number

The Eulerian number are the number of permutations of {1,2,...,n} with m ascents. They were introduced by Leonhard Euler in 1755 and in the notation of D. E. Knuth written as ${\displaystyle \left\langle {n \atop m}\right\rangle .}$ The two main formulas connecting the Eulerian number to the Bernoulli number are:

${\displaystyle \sum _{m=0}^{n}(-1)^{m}{\left\langle {n \atop m}\right\rangle }=2^{n+1}(2^{n+1}-1){\frac {B_{n+1}}{n+1}}\ ,}$

${\displaystyle \sum _{m=0}^{n}(-1)^{m}{\left\langle {n \atop m}\right\rangle }{\binom {n}{m}}^{-1}=(n+1)B_{n}\ .}$

Both formulas are valid for n ≥ 0 if B₁ is set to 1/2. If B₁ is set to −1/2 they are valid only for n ≥ 1 and n ≥ 2 respectively.

A binary tree representation

The Stirling polynomials σ_n(x) are related to the Bernoulli numbers by B_n = n!σ_n(1). S. C. Woon (Woon 1997) described an algorithm to compute σ_n(1) as a binary tree.

Woon's recursive algorithm (for n ≥ 1) starts by assigning to the root node N = . Given a node N = [a₁,a₂,..., a_k] of the tree, the left child of the node is L(N) =  and the right child R(N) = .

Given a node N the factorial of N is defined as

${\displaystyle N!=a_{1}\prod _{k=2...{\text{length}}(N)}a_{k}!\ .}$

Restricted to the nodes N of a fixed tree-level n the sum of 1/N! is σ_n(1), thus

${\displaystyle B_{n}=\sum _{N\ {\text{node of tree-level}}\ n}{\frac {n!}{N!}}\ .}$

For example B₁ = 1!(1/2!), B₂ = 2!(-1/3!+1/(2!2!)), B₃ = 3!(1/4!-1/(2!3!)-1/(3!2!)+1/(2!2!2!)).

Asymptotic approximation

Leonhard Euler expressed the Bernoulli numbers in terms of the Riemann zeta function as

${\displaystyle B_{2n}=(-1)^{n+1}{\frac {2(2n)!}{(2\pi )^{2n}}}\left.}$

It then follows from the Stirling formula that, as n goes to infinity,

${\displaystyle |B_{2n}|\sim 4{\sqrt {\pi n}}\left({\frac {n}{\pi e}}\right)^{2n}.}$

Integral representation and continuation

The integral

${\displaystyle b(s)=2e^{si\pi /2}\int _{0}^{\infty }{\frac {st^{s}}{1-e^{2\pi t}}}{\frac {dt}{t}}}$

has as special values b(2n) = B_2n for n > 0. The integral might be considered as a continuation of the Bernoulli numbers to the complex plane and this was indeed suggested by Peter Luschny in 2004.

For example b(3) = (3/2)ζ(3)ΠΙ and b(5) = −(15/2) ζ(5) ΠΙ. Here ζ(n) denotes the Riemann zeta function and Ι the imaginary unit. It is remarkable that already Leonhard Euler (Opera Omnia, Ser. 1, Vol. 10, p. 351) considered these numbers and calculated

${\displaystyle p={\frac {3}{2\pi ^{3}}}\left(1+{\frac {1}{2^{3}}}+{\frac {1}{3^{3}}}+{\text{etc.}}\ \right)=0.0581522\ldots \ ,}$

${\displaystyle q={\frac {15}{2\pi ^{5}}}\left(1+{\frac {1}{2^{5}}}+{\frac {1}{3^{5}}}+{\text{etc.}}\ \right)=0.0254132\ldots \ .}$

Euler's values are unsigned and real, but obviously his aim was to find a meaningful way to define the Bernoulli numbers at the odd integers n > 1.

The relation to the Euler numbers and π

The Euler numbers are a sequence of integers intimately connected with the Bernoulli numbers. Comparing the asymptotic expansions of the Bernoulli and the Euler numbers shows that the Euler numbers E_2n are in magnitude approximately (2/π)(4 − 2) times larger than the Bernoulli numbers B_2n. In consequence:

${\displaystyle \pi \ \sim \ 2\left(2^{2n}-4^{2n}\right){\frac {B_{2n}}{E_{2n}}}\ .}$

This asymptotic equation reveals that π lies in the common root of both the Bernoulli and the Euler numbers. In fact π could be computed from these rational approximations.

Bernoulli numbers can be expressed through the Euler numbers and vice versa. Since for n odd B_n = E_n = 0 (with the exception B₁), it suffices to regard the case when n is even.

${\displaystyle B_{n}=\sum _{k=0}^{n-1}{\binom {n-1}{k}}{\frac {n}{4^{n}-2^{n}}}E_{k}\quad (n=2,4,6,\ldots )}$

${\displaystyle E_{n}=\sum _{k=1}^{n}{\binom {n}{k-1}}{\frac {2^{k}-4^{k}}{k}}B_{k}\quad (n=2,4,6,\ldots ).}$

These conversion formulas express an inverse relation between the Bernoulli and the Euler numbers. But more important, there is a deep arithmetic root common to both kinds of numbers, which can be expressed through a more fundamental sequence of numbers, also closely tied to π. These numbers are defined for n > 1 as

${\displaystyle S_{n}=2\left({\frac {2}{\pi }}\right)^{n}\sum _{k=-\infty }^{\infty }\left(4k+1\right)^{-n}\quad (k=0,-1,1,-2,2,\ldots )}$

and S₁ = 1 by convention (Elkies 2003). The magic of these numbers lies in the fact that they turn out to be rational numbers. This was first proved by Leonhard Euler 1734 in a landmark paper `De summis serierum reciprocarum' (On the sums of series of reciprocals) and fascinated mathematicians ever since. The first few of these numbers are

${\displaystyle 1,1,{\frac {1}{2}},{\frac {1}{3}},{\frac {5}{24}},{\frac {2}{15}},{\frac {61}{720}},{\frac {17}{315}},{\frac {277}{8064}},{\frac {62}{2835}},\ldots }$

The Bernoulli numbers and Euler numbers are best understood as special views of these numbers, selected from the sequence S_n and scaled for use in special applications.

${\displaystyle B_{n}=(-1)^{\left\lfloor n/2\right\rfloor }\left{\frac {n!}{2^{n}-4^{n}}}\,S_{n}\ ,\quad (n=2,3,\ldots )\ ,}$

${\displaystyle E_{n}=(-1)^{\left\lfloor n/2\right\rfloor }\leftn!\,S_{n+1}\quad \qquad (n=0,1,\ldots )\ .}$

The expression has the value 1 if n is even and 0 otherwise (Iverson bracket).

These identities show that the quotient of Bernoulli and Euler numbers at the beginning of this section is just the special case of R_n = 2 S_n / S_n+1 when n is even. The R_n are rational approximations to π and two successive terms always enclose the true value of π. Beginning with n = 1 the sequence starts

${\displaystyle 2,4,3,{\frac {16}{5}},{\frac {25}{8}},{\frac {192}{61}},{\frac {427}{136}},{\frac {4352}{1385}},\ldots \quad \longrightarrow \pi \ .}$

These rational numbers also appear in the last paragraph of Euler's paper cited above. But it was only in September 2007 that this classical sequence found its way into the Encyclopedia of Integer Sequences (A132049).

An algorithmic view: the Seidel triangle

The sequence S_n has another unexpected yet important property: The denominators of S_n divide the factorial (n − 1)!. In other words: the numbers T_n = S_n(n − 1)! are integers.

${\displaystyle T_{n}=1,1,1,2,5,16,61,272,1385,7936,50521,353792,\ldots \quad (n=1,2,\ldots )}$

Thus the above representations of the Bernoulli and Euler numbers can be rewritten in terms of this sequence as

${\displaystyle B_{n}=(-1)^{\left\lfloor n/2\right\rfloor }\left{\frac {n}{2^{n}-4^{n}}}\,T_{n}\ ,\quad (n=2,3,\ldots )\ ,}$

${\displaystyle E_{n}=(-1)^{\left\lfloor n/2\right\rfloor }\leftT_{n+1}\quad \quad \qquad (n=0,1,\ldots )\ .}$

These identities make it easy to compute the Bernoulli and Euler numbers: the Euler numbers E_n are given immediately by T_2n + 1 and the Bernoulli numbers B_2n are obtained from T_2n by some easy shifting, avoiding rational arithmetic.

What remains is to find a convenient way to compute the numbers T_n. However, already in 1877 Philipp Ludwig von Seidel published an ingenious algorithm which makes it extremely simple to calculate T_n.

Start by putting 1 in row 0 and let k denote the number of the row currently being filled. If k is odd, then put the number on the left end of the row k − 1 in the first position of the row k, and fill the row from the left to the right, with every entry being the sum of the number to the left and the number to the upper. At the end of the row duplicate the last number. If k is even, proceed similar in the other direction.

Seidel's algorithm is in fact much more general (see the exposition of Dominique Dumont (1981)) and was rediscovered several times thereafter.

Similar to Seidel's approach D. E. Knuth and T. J. Buckholtz (1967) gave a recurrence equation for the numbers T_2n and recommended this method for computing B_2n and E_2n ‘on electronic computers using only simple operations on integers’.

V. I. Arnold rediscovered Seidel's algorithm in 1991 and later Millar, Sloane and Young popularized Seidel's algorithm under the name boustrophedon transform.

A combinatorial view: alternating permutations

Around 1880, three years after the publication of Seidel's algorithm, Désiré André proved a now classic result of combinatorial analysis. Looking at the first terms of the Taylor expansion of the trigonometric functions tan x and sec x André made a startling discovery.

${\displaystyle \tan x=1{\frac {x}{1!}}+2{\frac {x^{3}}{3!}}+16{\frac {x^{5}}{5!}}+272{\frac {x^{7}}{7!}}+7936{\frac {x^{9}}{9!}}+\cdots }$

${\displaystyle \sec x=1+1{\frac {x^{2}}{2!}}+5{\frac {x^{4}}{4!}}+61{\frac {x^{6}}{6!}}+1385{\frac {x^{8}}{8!}}+50521{\frac {x^{10}}{10!}}+\cdots }$

The coefficients are the Euler numbers of odd and even index, respectively. In consequence the ordinary expansion of tan x + sec x has as coefficients the rational numbers S_n.

${\displaystyle \tan x+\sec x=1+1x+{\frac {1}{2}}x^{2}+{\frac {1}{3}}x^{3}+{\frac {5}{24}}x^{4}+{\frac {2}{15}}x^{5}+{\frac {61}{720}}x^{6}+\cdots }$

André then succeeded by means of a recurrence argument to show that the alternating permutations of odd size are enumerated by the Euler numbers of odd index (also called tangent numbers) and the alternating permutations of even size by the Euler numbers of even index (also called secant numbers).

Generalizations by polynomials

The Bernoulli polynomials can be regarded as generalizations of the Bernoulli numbers the same as the Euler polynomials are generalizations of the Euler numbers.

Arithmetical properties of the Bernoulli numbers

The Bernoulli numbers can be expressed in terms of the Riemann zeta function as B_n = − nζ(1 − n) for integers n ≥ 0 provided for n = 0 and n = 1 the expression − nζ(1 − n) is understood as the limiting value and the convention B₁ = 1/2 is used. This intimately relates them to the values of the zeta function at negative integers. As such, they could be expected to have and do have deep arithmetical properties, a fact discovered by Kummer in his work on Fermat's last theorem.

Divisibility properties of the Bernoulli numbers are related to the ideal class groups of cyclotomic fields by a theorem of Kummer and its strengthening in the Herbrand-Ribet theorem, and to class numbers of real quadratic fields by Ankeny-Artin-Chowla. We also have a relationship to algebraic K-theory; if c_n is the numerator of B_n/2n, then the order of ${\displaystyle K_{4n-2}({\mathbb {Z} })}$ is −c_2n if n is even, and 2c_2n if n is odd.

The Agoh-Giuga conjecture postulates that p is a prime number if and only if pB_p−1 is congruent to −1 mod p.

Von Staudt–Clausen theorem

The von Staudt–Clausen theorem was given by Karl Georg Christian von Staudt and Thomas Clausen independently in 1840. It describes the arithmetical structure of the Bernoulli numbers.

The von Staudt–Clausen theorem has two parts. The first one describes how the denominators of the Bernoulli numbers can be computed. Paraphrasing the words of Clausen it can be stated as:

“The denominator of the 2nth Bernoulli number can be found as follows: Add to all divisors of 2n, 1, 2, a, a', ..., 2n the unity, which gives the sequence 2, 3, a + 1, a' + 1, ..., 2n + 1. Select from this sequence only the prime numbers 2, 3, p, p', etc. and build their product.”

Clausen's algorithm translates almost verbatim to a modern computer algebra program, which looks similar to the pseudocode on the left hand site of the following table. On the right hand side the computation is traced for the input n = 88. It shows that the denominator of B₈₈ is 61410. 

The second part of the von Staudt–Clausen theorem is a very remarkable representation of the Bernoulli numbers. This representation is given for the first few nonzero Bernoulli numbers in the next table.

The theorem affirms the existence of an integer I_n such that

${\displaystyle B_{n}={\frac {I_{n}}{2}}-\sum _{(p-1)|n}{\frac {1}{p}}\quad (n\geq 0)\ .}$

The sum is over the primes p for which p − 1 divides n. These are the same primes which are employed in the Clausen algorithm. The proposition holds true for all n ≥ 0, not only for even n. I₁ = 2 and for odd n > 1, I_n = 1.

Consequences of the von Staudt–Clausen theorem are: the denominators of the Bernoulli numbers are square-free and for n ≥ 2 divisible by 6.

Why do the odd Bernoulli numbers vanish?

The sum

${\displaystyle \varphi _{k}(n)=\sum _{i=0}^{n}i^{k}-{\frac {n^{k}}{2}}}$

can be evaluated for negative values of the index n. Doing so will show that it is an odd function for even values of k, which implies that the sum has only terms of odd index. This and the formula for the Bernoulli sum imply that B_2k+1−m is 0 for m odd and greater than 1; and that the term for B₁ is cancelled by the subtraction. The von Staudt-Clausen theorem combined with Worpitzky's representation also gives a combinatorial answer to this question (valid for n > 1).

From the von Staudt-Clausen theorem it is known that for odd n > 1 the number 2B_n is an integer. This seems trivial if one knows beforehand that in this case B_n = 0. However, by applying Worpitzky's representation one gets

${\displaystyle 2B_{n}=\sum _{m=0}^{n}\left(-1\right)^{m}{\frac {2}{m+1}}m!\left\{{\begin{matrix}n+1\\m+1\end{matrix}}\right\}=0\quad \left(n>1\ {\text{odd}}\right)}$

as a sum of integers, which is not trivial. Here a combinatorial fact comes to surface which explains the vanishing of the Bernoulli numbers at odd index. Let S_n,m be the number of surjective maps from {1, 2, ..., n} to {1, 2, ..., m}, then ${\displaystyle S_{n,m}=m!\left\{{\begin{matrix}n\\m\end{matrix}}\right\}}$. The last equation can only hold if

${\displaystyle \sum _{m=1,3,5,\ldots \leq n}{\frac {2}{m^{2}}}S_{n,m}=\sum _{m=2,4,6,\ldots \leq n}{\frac {2}{m^{2}}}S_{n,m}\quad \left(n>2{\text{ even}}\right).\ }$

This equation can be proved by induction. The first two examples of this equation are

n = 4 :  2 + 8 = 7 + 3,  n = 6:  2 + 120 + 144 = 31 + 195 + 40.

Thus the Bernoulli numbers vanish at odd index because some non-obvious combinatorial identities are embodied in the Bernoulli numbers.

p-adic continuity

An especially important congruence property of the Bernoulli numbers can be characterized as a p-adic continuity property. If b, m and n are positive integers such that m and n are not divisible by p − 1 and ${\displaystyle m\equiv n\,{\bmod {\,}}p^{b-1}(p-1)}$, then

${\displaystyle (1-p^{m-1}){B_{m} \over m}\equiv (1-p^{n-1}){B_{n} \over n}\,{\bmod {\,}}p^{b}.}$

Since ${\displaystyle B_{n}=-n\zeta (1-n)}$, this can also be written

${\displaystyle (1-p^{-u})\zeta (u)\equiv (1-p^{-v})\zeta (v)\,{\bmod {\,}}p^{b}\,,}$

where u = 1 − m and v = 1 − n, so that u and v are nonpositive and not congruent to 1 mod p − 1. This tells us that the Riemann zeta function, with 1 − p taken out of the Euler product formula, is continuous in the p-adic numbers on odd negative integers congruent mod p − 1 to a particular ${\displaystyle a\not \equiv 1\,{\bmod {\,}}p-1}$, and so can be extended to a continuous function ${\displaystyle \zeta _{p}(s)}$ for all p-adic integers ${\displaystyle {\mathbb {Z}}_{p},\,}$ the p-adic Zeta function.

Bernoulli numbers and the Riemann hypothesis

The connection between the Bernoulli numbers and the Riemann zeta function is strong enough to provide an alternate formulation of the Riemann hypothesis (RH) which uses only the Bernoulli number. In fact in 1916 M. Riesz proved that the RH is equivalent to the following assertion:

For every ε > 1/4 there exists a constant C_ε > 0 (depending on ε) such that |R(x)| < C_ε x as x → ∞.

Here R(x) is the Riesz function

${\displaystyle R(x)=2\sum _{k=1}^{\infty }{\frac {k^{\overline {k}}x^{k}}{(2\pi )^{2k}\left(B_{2k}/(2k)\right)}}=2\sum _{k=1}^{\infty }{\frac {k^{\overline {k}}x^{k}}{(2\pi )^{2k}\beta _{2k}}}.\ }$

${\displaystyle n^{\overline {k}}}$ denotes the rising factorial power in the notation of D. E. Knuth. The number β_n = B_n/n occur frequently in the study of the zeta function and are significant because β_n is a p-integer for primes p where p − 1 does not divide n. The β_n are called divided Bernoulli number.

Ramanujan's congruences

The following relations, due to Ramanujan, provide a more efficient method for calculating Bernoulli numbers:

${\displaystyle m\equiv 0\,{\bmod {\,}}6\qquad {{m+3} \choose {m}}B_{m}={{m+3} \over 3}-\sum _{j=1}^{m/6}{m+3 \choose {m-6j}}B_{m-6j}}$

${\displaystyle m\equiv 2\,{\bmod {\,}}6\qquad {{m+3} \choose {m}}B_{m}={{m+3} \over 3}-\sum _{j=1}^{(m-2)/6}{m+3 \choose {m-6j}}B_{m-6j}}$

${\displaystyle m\equiv 4\,{\bmod {\,}}6\qquad {{m+3} \choose {m}}B_{m}=-{{m+3} \over 6}-\sum _{j=1}^{(m-4)/6}{m+3 \choose {m-6j}}B_{m-6j}.}$

Use of Bernoulli numbers in topology

The Kervaire–Milnor formula for the order of the cyclic group of diffeomorphism classes of exotic (4n − 1)-spheres which bound parallelizable manifolds for n ≥ 2 involves Bernoulli numbers; if B_(n) is the numerator of B_4n/n, then

${\displaystyle 2^{2n-2}(1-2^{2n-1})B_{(n)}}$

is the number of such exotic spheres. (The formula in the topological literature differs because topologists use a different convention for naming Bernoulli numbers; this article uses the number theorists' convention.)

Assorted identities

• Let n be non-negative and even

  ${\displaystyle \zeta (n)={\frac {\left(-1\right)^{{\frac {n}{2}}-1}B_{n}\left(2\pi \right)^{n}}{2n!}}}$

• The nth cumulant of the uniform probability distribution on the interval is B_n/n.
• Let n¡ = 1/n! and n ≥ 1. Then B_n is n! times the determinant of the following matrix.

  Bn =

  1 ─── n¡

  2¡ 1¡ 0 0 0 ... 0 3¡ 2¡ 1¡ 0 0 ... 0 4¡ 3¡ 2¡ 1¡ 0 ... 0 ... ... ... ... ... ... ... (n − 2)¡ ... ... 3¡ 2¡ 1¡ 0 (n − 1)¡ (n − 2)¡ ... ... 3¡ 2¡ 1¡ n¡ (n − 1)¡ (n − 2)¡ ... ... 3¡ 2¡

  Thus the determinant is σ_n(1), the Stirling polynomial at x = 1.

• Let n ≥ 1.

  ${\displaystyle {\frac {1}{n}}\sum _{k=1}^{n}{\binom {n}{k}}B_{k}B_{n-k}+B_{n-1}=-B_{n}\quad {\text{(L. Euler)}}}$

• Let n ≥ 1. Then (von Ettingshausen 1827)

  ${\displaystyle \sum _{k=0}^{n}{\binom {n+1}{k}}(n+k+1)B_{n+k}=0}$

• Let n ≥ 0. Then (Leopold Kronecker 1883)

  ${\displaystyle B_{n}=-\sum _{k=1}^{n+1}{\frac {(-1)^{k}}{k}}{\binom {n+1}{k}}\sum _{j=1}^{k}j^{n}}$

• Let n ≥ 1 and m ≥ 1. Then (Carlitz 1968)

  ${\displaystyle (-1)^{m}\sum _{r=0}^{m}{\binom {m}{r}}B_{n+r}=(-1)^{n}\sum _{s=0}^{n}{\binom {n}{s}}B_{m+s}}$

• Let n ≥ 4 and

  ${\displaystyle H_{n}=\sum _{1\leq k\leq n}k^{-1}}$

  the harmonic number. Then

  ${\displaystyle {\frac {n}{2}}\sum _{k=2}^{n-2}{\frac {B_{n-k}}{n-k}}{\frac {B_{k}}{k}}-\sum _{k=2}^{n-2}{\binom {n}{k}}{\frac {B_{n-k}}{n-k}}B_{k}=H_{n}B_{n}\qquad {\text{(H. Miki, 1978)}}}$

• Let n ≥ 4. Yuri Matiyasevich found (1997)

  ${\displaystyle (n+2)\sum _{k=2}^{n-2}B_{k}B_{n-k}-2\sum _{l=2}^{n-2}{\binom {n+2}{l}}B_{l}B_{n-l}=n(n+1)B_{n}}$

• Let n ≥ 1

  ${\displaystyle {\frac {n}{2}}\left(B_{n-1}(x)+\sum _{k=1}^{n-1}{\frac {B_{k}(x)}{k}}{\frac {B_{n-k}(x)}{n-k}}\right)-\sum _{k=0}^{n-1}{\binom {n}{k}}{\frac {B_{n-k}}{n-k}}B_{k}(x)=H_{n-1}B_{n}(x)}$

  This is an identity by Faber-Pandharipande-Zagier-Gessel. Choose x = 0 or x = 1 to get a Bernoulli number identity according to your favourite convention.
• The next formula is true for n ≥ 0 if B₁ = B₁(1) = 1/2, but only for n ≥ 1 if B₁ = B₁(0) = -1/2.

  ${\displaystyle \sum _{k=0}^{n}{\binom {n}{k}}{\frac {B_{k}}{n-k+2}}={\frac {B_{n+1}}{n+1}}}$

• Let n ≥ 0 and = 1 if b is true, 0 otherwise.

  ${\displaystyle -1+\sum _{k=0}^{n}{\binom {n}{k}}{\frac {2^{n-k+1}}{n-k+1}}B_{k}(1)=2^{n}}$

  and

  ${\displaystyle -1+\sum _{k=0}^{n}{\binom {n}{k}}{\frac {2^{n-k+1}}{n-k+1}}B_{k}(0)=}$

See also

• poly-Bernoulli number
• q-Bernoulli number
• Bernoulli polynomials
• Riemann zeta function
• Hurwitz zeta function
• Euler number
• Euler summation

Notes

1. Note G in the Menabrea reference
2. Mathematics Genealogy Project
3. Earliest Uses of Symbols of Calculus
4. Concrete Mathematics, (2.51)
5. Concrete Mathematics, (9.67).
6. Concrete Mathematics, (2.44) and (2.52)
7. Concrete Mathematics, Table 254 Euler's triangle.

References

• Abramowitz, M.; Stegun, C. A. (1972), "§23.1: Bernoulli and Euler Polynomials and the Euler-Maclaurin Formula", Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables (9th printing ed.), New York: Dover, pp. 804–806.
• André, D. (1879), "Développements de sec x et tan x.", Comptes Rendus Acad. Sci., 88: 965–967.
• André, D. (1881), "Mémoire sur les permutations alternées", J. Math., 7: 167–184.
• Arlettaz, D. (1998), "Die Bernoulli-Zahlen: eine Beziehung zwischen Topologie und Gruppentheorie", Math. Semesterber, 45: 61–75, doi:10.1007/s005910050037.
• Arnold, V. I. (1991), "Bernoulli-Euler updown numbers associated with function singularities, their combinatorics and arithmetics", Duke Math. J., 63: 537–555.
• Ayoub, A. (1981), "Euler and the Zeta Function", Amer. Math. Monthly, 74: 1067–1086.
• Buhler, J.; Crandall, R.; Ernvall, R.; Metsankyla, T.; Shokrollahi, M. (2001), "Irregular Primes and Cyclotomic Invariants to 12 Million", Journal of Symbolic Computation, 31 (1–2): 89–96, doi:10.1006/jsco.1999.1011 {{citation}}: Italic or bold markup not allowed in: |journal= (help).
• Carlitz, L. (1968), "Bernoulli Numbers.", Fib. Quart., 6: 71–85.
• Clausen, Thomas (1840), "Lehrsatz aus einer Abhandlung über die Bernoullischen Zahlen", Astr. Nachr., 17: 351–352.
• Conway, John; Guy (1996), The Book of Numbers, Springer-Verlag {{citation}}: Cite has empty unknown parameter: |unused_data= (help); Unknown parameter |firshttp://en.wikipedia.org/search/?title= ignored (help).
• Dilcher, K.; Skula, L.; Slavutskii, I. Sh. (1991), "Bernoulli numbers. Bibliography (1713–1990)", Queen's Papers in Pure and Applied Mathematics (87), Kingston, Ontario
• Dumont, D.; Viennot, G. (1980), "A combinatorial interpretation of Seidel generation of Genocchi numbers", Ann. Discrete Math., 6: 77–87, doi:10.1016/S0167-5060(08)70696-4.
• Dumont, D. (1981), "Matrices d'Euler-Seidel", Séminaire Lotharingien de Combinatoire
• Elkies, N. D. (2003), "On the sums Sum_(k=-infinity...infinity) (4k+1)^(-n)", Amer. Math. Monthly, 110 (No. 7): 561–573
• Entringer, R. C. (1966), "A combinatorial interpretation of the Euler and Bernoulli numbers", Nieuw. Arch. V. Wiskunde, 14: 241–6.
• von Ettingshausen, A. (1827), Vorlesungen über die höhere Mathematik, vol. Bd. 1, Vienna: Carl Gerold.
• Euler, Leonhard (1735), "De summis serierum reciprocarum", Opera Omnia, I.14, E 41, : 73–86{{citation}}: CS1 maint: extra punctuation (link); On the sums of series of reciprocals, arXiv:math/0506415v2 (math.HO).
• Fee, G.; Plouffe, S. (2007), An efficient algorithm for the computation of Bernoulli numbers. arXiv:math/0702300v2 (math.NT)
• Graham, R. L.; Knuth, D. E.; Patashnik, O. (1989), Concrete Mathematics, Addison-Wesley.
• Guo, Victor J. W.; Zeng, Jiang (2005), "A q-Analogue of Faulhaber's Formula for Sums of Powers", The Electronic Journal of Combinatorics, 11(2)
• Harvey, David (2008), A multimodular algorithm for computing Bernoulli numbers arXiv:0807.1347v2 math.NT
• Ireland, Kenneth; Rosen, Michael (1990), A Classical Introduction to Modern Number Theory, Springer-Verlag
• Jacobi, C. G. J. (1834), "De usu legitimo formulae summatoriae Maclaurinianae", Journal für die reine und angewandte Mathematik, 12: 263–272
• Jordan, Charles (1950), Calculus of Finite Differences, New York: Chelsea Publ. Co..
• Kaneko, M. (2000), "The Akiyama-Tanigawa algorithm for Bernoulli numbers", Journal of Integer Sequences, 12.
• Kellner, Bernd (2002), Program Calcbn - A program for calculating Bernoulli numbers.
• Knuth, D. E.; Buckholtz, T. J. (1967), "Computation of Tangent, Euler, and Bernoulli Numbers", Mathematics of Computation, 21: 663–688, doi:10.2307/2005010.
• Knuth, D. E. (1993), "Johann Faulhaber and the Sums of Powers", Mathematics of Computation, 61: 277–294 arXiv:math/9207222 (math.CA).
• Luschny, Peter (2007), An inclusion of the Bernoulli numbers
• Menabrea, L. F., "Sketch of the Analytic Engine invented by Charles Babbage, with notes upon the Memoir by the Translator Ada Augusta, Countess of Lovelace." Bibliothèque Universelle de Genève, October 1842, No. 82. http://www.fourmilab.ch/babbage/sketch.html
• Milnor, John W.; Stasheff, James D. (1974), "Appendix B: Bernoulli Numbers", Characteristic Classes, Annals of Mathematics Studies, vol. 76, Princeton University Press and University of Tokyo Press, pp. 281–287.
• Neukirch, Jürgen (1999). Algebraische Zahlentheorie. Grundlehren der mathematischen Wissenschaften. Vol. 322. Berlin: Springer-Verlag. ISBN 978-3-540-65399-8. MR 1697859. Zbl 0956.11021.
• Pavlyk, Oleksandr (2008), Today We Broke the Bernoulli Record: From the Analytical Engine to Mathematica, Wolfram Blog.
• Riesz, M. (1916), "Sur l'hypothèse de Riemann", Acta Mathematica, 40: 185–90, doi:10.1007/BF02418544.
• Saalschütz, Louis (1893), Vorlesungen über die Bernoullischen Zahlen, ihren Zusammenhang mit den Secanten-Coefficienten und ihre wichtigeren Anwendungen, Berlin {{citation}}: Text "publisherJulius Springer" ignored (help)CS1 maint: location missing publisher (link)
• Seidel, L. (1877), "Über eine einfache Entstehungsweise der Bernoullischen Zahlen und einiger verwandten Reihen", Sitzungsber. Münch. Akad., 4: 157–187.
• Slavutskii, Ilya Sh. (1995), "Staudt and arithmetical properties of Bernoulli numbers", Historia Scientiarum, 2: 69–74.
• von Staudt, K. G. Ch. (1840), "Beweis eines Lehrsatzes, die Bernoullischen Zahlen betreffend", Journal für die reine und angewandte Mathematik, 21: 372–374.
• von Staudt, K. G. Ch. (1845), "De numeris Bernoullianis, commentationem alteram", Erlangen.
• Sun, Zhi-Wei (2005/2006), Some curious results on Bernoulli and Euler polynomials {{citation}}: Check date values in: |year= (help)CS1 maint: year (link).
• Woon, S. C. (1997), "A tree for generating Bernoulli numbers", Math. Mag., 70: 51–56.
• Woon, S. C. (1998), Generalization of a relation between the Riemann zeta function and Bernoulli numbers
• Worpitzky, J. (1883), "Studien über die Bernoullischen und Eulerschen Zahlen", Journal für die reine und angewandte Mathematik, 94: 203–232}.

External links

• The first 498 Bernoulli Numbers from Project Gutenberg
• The first 10,000 Bernoulli numbers
• A multimodular algorithm for computing Bernoulli numbers
• The Bernoulli Number Page
• Bernoulli number programs at LiteratePrograms
• Weisstein, Eric W. "Bernoulli Number". MathWorld.
• The Computation of Irregular Primes
• Online Bernoulli Numbers Generator
• Some properties,sums of Bernoulli-and related numbers

• Number theory
• Topology
• Integer sequences