Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Regardless of form, I want to know how I can get some interpretation (closed formula preferred) of $B_n$ that is equivalent to $m$ digits of precision, and I'd like to know the fastest way to do it (in terms of calculations required to get the estimate). Can someone please help?

For your information, you may want to consider Wikipedia's page on Bernoulli numbers. I've been attempting to use the "explicit definition" that they give, but I've been running into problems. I'll keep you informed of the progress that I make...

share|cite|improve this question
What exactly is your question? Does not… answer it, with references? – lhf Nov 2 '11 at 16:23
@lhf: No, they give formulas for how to get $B_n$ - but they don't tell which method is fastest for a given amount of precision. I want to know the fastest way to get $B_n$ to $m$ digits of precision. – Matt Groff Nov 2 '11 at 16:28
Have you seen Fillebrown's and Harvey's papers? – J. M. Nov 2 '11 at 16:40
@J.M.: Thanks for the links! I am looking for an estimate, though, which may be easier and quicker to calculate... – Matt Groff Nov 2 '11 at 16:59

I will assume that $m$ is small. Then a good approximation is obtained from the following $$ B_{2n} = (-1)^{n-1} 2 \frac{(2n)!}{(2\pi)^{2n}} \zeta(2n) = (-1)^{n-1} 2 \frac{(2n)!}{(2\pi)^{2n}} \prod_{i \ge 1} \left( 1 - \frac{1}{p_i^{2n}} \right)^{-1} $$

To obtain sufficient approximation you truncate the product over primes accordingly. See these slides from W. Stein.

share|cite|improve this answer
Can someone give an asymptotic bounds for precision as a function of $i$, or vice versa? I'd like to see how this compares, if possible... – Matt Groff Nov 2 '11 at 16:41

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.