Bernoulli number

From Free net encyclopedia

In mathematics, the Bernoulli numbers are a sequence of rational numbers with deep connections in number theory. Although easy to calculate, the values of the Bernoulli numbers have no elementary description; they are closely related to the values of the Riemann zeta function at negative integers.

In Europe, they were first studied by Jakob Bernoulli, after whom they were named by Abraham de Moivre, and independently discovered, perhaps earlier, by Seki Kowa. They appear in the Taylor series expansion of the tangent and hyperbolic tangent functions, in the Euler-Maclaurin formula, and in expressions of certain values of the Riemann zeta function.

Curiously, in note G of Ada Byron's notes on the analytical engine from 1842 an algorithm for computer-generated Bernoulli numbers was described for the first time. This distinguishes the Bernoulli numbers as being the subject of one of the first computer programs ever.

Contents 1 Introduction 2 Assorted identities 3 Arithmetical properties of the Bernoulli numbers 3.1 p-adic continuity 4 Geometrical properties of the Bernoulli numbers 5 Efficient computation of Bernoulli numbers mod p 6 See also 7 External links 8 References

Introduction

The Bernoulli numbers B_n were first discovered in connection with the closed forms of the sums

<math>\sum_{k=0}^{m-1} k^n = 0^n + 1^n + 2^n + \cdots + {(m-1)}^n </math>

for various fixed values of n. The closed forms are always polynomials in m of degree n + 1. (They are not the same as the Bernoulli polynomials.) The coefficients of these polynomials are closely related to the Bernoulli numbers, as follows:

<math>\sum_{k=0}^{m-1} k^n = {1\over{n+1}}\sum_{k=0}^n{n+1\choose{k}} B_k m^{n+1-k}.</math>

For example, taking n to be 1, we have 0 + 1 + 2 + ... + (m−1) = 1/2 (B₀ m² + 2 B₁ m¹) = 1/2 (m² − m).

Bernoulli numbers may be calculated by using the following recursive formula:

<math>\sum_{j=0}^m{m+1\choose{j}}B_j = 0</math>

plus the initial condition that B₀ = 1.

The Bernoulli numbers may also be defined using the technique of generating functions. Their exponential generating function is x/(e^x − 1), so that:

<math>

\frac{x}{e^x-1} = \sum_{n=0}^{\infin} B_n \frac{x^n}{n!} </math> for all values of x of absolute value less than 2π (the radius of convergence of this power series).

Sometimes the lower-case b_n is used in order to distinguish these from the Bell numbers.

The first few Bernoulli numbers (sequences A027641 and A027642 in OEIS) are listed below.

n	Bn
0	1
1	−1/2
2	1/6
3	0
4	−1/30
5	0
6	1/42
7	0
8	−1/30
9	0
10	5/66
11	0
12	−691/2730
13	0
14	7/6

It can be shown that B_n = 0 for all odd n other than 1. The appearance of the peculiar value B₁₂ = −691/2730 suggests that the values of the Bernoulli numbers have no elementary description. In fact they may be derived in a simple way from the values of the Riemann zeta function at negative integers (since ζ(−n) = −B_n+1/(n + 1) for all positive integers n), and are as a consequence connected to deep number-theoretic properties, and could not be expected to have a trivial formulation.

Assorted identities

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

<math>B_{2k}=2(-1)^{k+1}\frac {\zeta(2k)\; (2k)!} {(2\pi)^{2k}}. </math>

The nth cumulant of the uniform probability distribution on the interval [−1, 0] is B_n/n.

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

<math>m\equiv 0\,\bmod\,6\qquad {{m+3}\choose{m}}B_m={{m+3}\over3}-\sum_{j=1}^{m/6}{m+3\choose{m-6j}}B_{m-6j}</math>

<math>m\equiv 2\,\bmod\,6\qquad {{m+3}\choose{m}}B_m={{m+3}\over3}-\sum_{j=1}^{(m-2)/6}{m+3\choose{m-6j}}B_{m-6j}</math>

<math>m\equiv 4\,\bmod\, 6\qquad{{m+3}\choose{m}}B_m=-{{m+3}\over6}-\sum_{j=1}^{(m-4)/6}{m+3\choose{m-6j}}B_{m-6j}</math>

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), which 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 <math>K_{4n-2}(\Bbb{Z})</math> is −c_2n if n is even, and 2c_2n if n is odd.

Also related to divisibility is the von Staudt-Clausen theorem which tells us if we add 1/p to B_n for every prime p such that p − 1 divides n, we obtain an integer. This fact immediately allows us to characterize the denominators of the non-zero Bernoulli numbers B_n as the product of all primes p such that p − 1 divides n; consequently the denominators are square-free and divisible by 6.

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

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 <math>m \equiv n\, \bmod\,p^{b-1}(p-1)</math>, then

<math>(1-p^{m-1}){B_m \over m} \equiv (1-p^{n-1}){B_n \over n} \,\bmod\, p^b.</math>

Since <math>B_n = -n\zeta(1-n)</math>, this can also be written

<math>(1-p^{-u})\zeta(u) \equiv (1-p^{-v})\zeta(v)\, \bmod \,p^b\,,</math>

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 <math>1-p^z</math> 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 <math>a \not\equiv 1\, \bmod\, p-1</math>, and so can be extended to a continuous function <math>\zeta_p(z)</math> for all p-adic integers <math>\Bbb{Z}_p,\,</math> the p-adic Zeta function.

Geometrical properties of the Bernoulli numbers

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

<math>2^{2n-2}(1-2^{2n-1})B</math>

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.)

Efficient computation of Bernoulli numbers mod p

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 (see Buhler et al) which require only O(p (log p)²) operations (see big-O notation).

See also

• Riemann zeta function
• poly-Bernoulli numbers

External links

• The Bernoulli Number Page
• Online Encyclopedia of Integer Sequences -- entry on a sequence related to the Bernoulli numbers
• The first 498 Bernoulli Numbers from Project Gutenberg

References

• Buhler, J., Crandall, R., Ernvall, R., Metsankyla, T., and Shokrollahi, M. "Irregular Primes and Cyclotomic Invariants to 12 Million." J. Symb. Comput. 11, 1-8, 2000.ar:عدد بيرنولي

de:Bernoulli-Zahlen es:Número de Bernoulli fr:Nombre de Bernoulli it:Numeri di Bernoulli nl:Bernoulli-getal ja:ベルヌーイ数 pl:Liczby Bernoulliego ru:Числа Бернулли fi:Bernoullin luku zh:伯努利数