A multimodular algorithm for computing Bernoulli numbers

DOI10.1090/S0025-5718-2010-02367-1zbMath1215.11016arXiv0807.1347OpenAlexW2963907200WikidataQ56039767 ScholiaQ56039767MaRDI QIDQ3160744

David I. Harvey

Publication date: 8 October 2010

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.1347

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Number-theoretic algorithms; complexity (11Y16) Calculation of integer sequences (11Y55)

Related Items

An alternative to the Euler-Maclaurin summation formula: approximating sums by integrals only ⋮ A subquadratic algorithm for computing the $n$-th Bernoulli number ⋮ Numerical calculation of the Riemann zeta function at odd-integer arguments: a direct formula method ⋮ Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers ⋮ Irregular primes to 163 million ⋮ Irregular primes with respect to Genocchi numbers and Artin's primitive root conjecture ⋮ Irregular primes to two billion

Uses Software

• gmp
• Mathematica
• NTL
• PARI/GP
• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finding primitive roots in finite fields
• Fast multiplication of large numbers
• Modular Multiplication Without Trial Division
• Faster computation of Bernoulli numbers
• On Schönhage's algorithm and subquadratic integer gcd computation
• An "exact" formula for the m-th Bernoulli number
• SAGE