A subquadratic algorithm for computing the $n$-th Bernoulli number

DOI10.1090/S0025-5718-2014-02832-9zbMath1370.11034arXiv1209.0533OpenAlexW2907934284MaRDI QIDQ3189433

David I. Harvey

Publication date: 10 September 2014

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

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

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Calculation of integer sequences (11Y55)

Related Items (1)

Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing Frobenius maps and factoring polynomials
• A multimodular algorithm for computing Bernoulli numbers
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
• Fast Computation of Bernoulli, Tangent and Secant Numbers
• Number Theory

This page was built for publication: A subquadratic algorithm for computing the $n$-th Bernoulli number