An efficient algorithm for the computation of Bernoulli numbers

arXivmath/0702300MaRDI QIDQ6478759FDOQ6478759

Authors: G. Fee, Simon Plouffe 

Publication date: 10 February 2007

Abstract: This article gives a direct formula for the computation of B(n) using the asymptotic formula ${\displaystyle }$B (n) approx 2 {frac {n!}{{pi}^{n}{2}^{n}}}${\displaystyle }$ where n is even and $n>>1$. This is simply based on the fact that $zeta(n)$ is very near 1 when n is large and since $B(n)=2fraczeta(n)n!{pi}^n{2}^n$ exactly. The formula chosen for the Zeta function is the one with prime numbers from the well-known Euler product for $zeta(n)$. This algorithm is far better than the recurrence formula for the Bernoulli numbers even if each B(n) is computed individually. The author could compute $B(750,000)$ in a few hours. The current record of computation is now (as of Feb. 2007) $B(5,000,000)$ a number of (the numerator) of 27332507 decimal digits is also based on that idea.

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68)

This page was built for publication: An efficient algorithm for the computation of Bernoulli numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478759)