The Bernoulli Number Page


News
1-Jun-2004
Some updates. Manual for program Calcbn v1.2
10-Feb-2003
The two millionth Bernoulli number calculated
8-Feb-2003
The 1.5 millionth Bernoulli number calculated
6-Feb-2003
Program Calcbn v1.2: now up to 1.7 times faster
26-Jan-2003
Program Calcbn v1.1: now 1.6 times faster by optimization of implementation
18-Jan-2003
Program Calcbn for Windows/Linux and some factorizations of numerators
16-Dec-2002
The one millionth Bernoulli number was calculated by using program Calcbn
15-Dec-2002
Website created
Introduction

The Bernoulli numbers Bn play an important role in several topics of mathematics. These numbers can be defined by the power series

where all numbers Bn are zero with odd index n>1. The even-indexed rational numbers Bn alternate in sign. The first values are

For more detailed introduction and basic properties see link below [2]. Also a short overview is given in the manual of Calcbn.

The two millionth Bernoulli number

More than 10 million digits were omitted in the middle of the numerator!

The 1.5 millionth Bernoulli number

More than 7.4 million digits were omitted in the middle of the numerator!

The one millionth Bernoulli number

More than 4.7 million digits were omitted in the middle of the numerator!

Table of calculated Bernoulli numbers

Index
250,000
500,000
750,000
1,000,000
Time (v 1.0)
16-Dec-2002
Windows
2,303 s
38.4 min
9,861 s
2.74 h
23,316 s
6.48 h
47,904 s
13.31 h
Time (v 1.1)
26-Jan-2003
Windows
1,426 s
23.8 min
5,989 s
1.66 h
14,041 s
3.90 h
30,083 s
8.36 h
Time (v 1.2)
6-Feb-2003
Windows
1,386 s
23.1 min
5,835 s
1.62 h
13,660 s
3.79 h
29,309 s
8.14 h
Time (v 1.2)
6-Feb-2003
Linux
1,222 s
20.4 min
5,188 s
1.44 h
11,712 s
3.25 h
25,936 s
7.20 h
Digits of
numerator
1,041,387
2,233,273
3,481,993
4,767,554
File
b250t.zip
(480 KB)
b500t.zip
(1,026 KB)
b750t.zip
(1,599 KB)
b1000t.zip
(2,189 KB)
Index
1,500,000
2,000,000
Time (v 1.2)
8/10-Feb-2003
Windows
65,504 s
18.2 h
126,316 s
35.1 h
Digits of
numerator
7,415,484
10,137,147
File
b1500t.zip
(3,403 KB)
b2000t.zip
(4,652 KB)

Computed on a PC running under Windows XP and Linux (SuSE 8.1) with 2,0 GHz AMD Athlon XP 2400+ processor and 1024 MB RAM, 512 MB used by apfloat. Program Calcbn was used to calculate all numbers as rational numbers. This program was written in C++ using the apfloat library [7], the algorithm calculates the main part only with integers. Now the implementation of Calcbn v1.2 has been optimized by faster computation of powers and factorials.Calculation of consecutive Bernoulli numbers is also faster. v1.2 needs a little bit more memory than v1.1. All results were checked by Kummer congruences in different prime moduli (parameter --check num).

Program Calcbn - A program for calculating the Bernoulli numbers

Version
Windows 98/ME/NT/XP
Linux
Manual
1.1
calcbn11.zip (245 KB)
calcbn11.tar.gz (gcc 2.95) (227 KB)
1.2
calcbn12.zip (245 KB)
calcbn12.tar.gz (gcc 3.20) (227 KB) manual.pdf (163 KB)

Calcbn can be freely used without warranty of any kind, all rights reserved.

Factorizations of numerators

Factorizations of numerators of Bernoulli numbers with index 2 to 10000. Calculated prime factors are less than one million.

Download file (111 KB) factors10t.txt or file (39 KB) factors10t.zip

Irregular pairs of higher order

The irregular pairs of higher order describe the first appearance of higher powers of irregular prime factors of Bn/n. An irregular pair (p,n) of order r has the property that pr divides Bn/n with n < pr-1(p-1). Note that n is always an even positive integer. There exists a criterion to check whether the sequence of irregular pairs of higher order is unique. It has been proven for all irregular primes below 12 million that there are only unique sequences. Writing sequences p-adically these pairs of higher order provide an approximation of a uniquely existing zero of the p-adic zeta function associated with an irregular pair. For definition and properties see link [6] below.

Example:

Irregular pairs of higher order can be effectively and easily calculated using Bernoulli numbers with small indices. By this means one can even predict the very large index of the first occurence of the power 3737 as listed above.

Table of irregular pairs of order 10 for irregular primes below 1000: irrpairord.txt

A conjectural structural formula for the Bernoulli numbers

Assuming that all sequences of irregular pairs of higher order are unique resp. each p-adic zeta function associated with an irregular pair has a unique zero, one can describe the structure of divided Bernoulli numbers resp. the value of the Riemann zeta function at negative odd integer arguments as follows:

Under the proposed assumption, one can give some interpretation of the formula above. The denominator can be described by poles (always lying at 0) and the numerator by zeros of p-adic zeta functions measuring the distance to them using the p-adic metric induced by the standard ultrametric absolute value | |p. Note that this formula is valid for all irregular primes below 12 million. For detailed statements see link [6] below. The formula conjecturally states for the Bernoulli numbers that


A conjectural structural formula for the Euler numbers

Similarly, for the Euler numbers En, n > 0 and even, one can state also a conjectural formula:



Here (p,l) are irregular pairs associated with the Euler numbers and the ξ (p,l)  are certain zeros of  p-adic L-functions.

Asymptotic formula

The product of Bernoulli numbers is described by the following asymptotic formula

with an asymptotic constant C2 = 4.855096646522...

where C1 = 1.8210174514992... is the product over all values of the Riemann zeta function at even positive integers and A = 1.2824271291... is the Glaisher-Kinkelin constant


Links

Created by Bernd C. Kellner, Göttingen, Germany.
For questions or suggestions: bk(at)bernoulli.org
Last updated: Jun 21, 2006