The DC algorithm for computing sums of powers of consecutive integers and Bernoulli numbers

zbMATH Open1172.11312MaRDI QIDQ3606438FDOQ3606438

Authors: Gwiyeon Kim, Byungki Kim, J. Y. Choi 

Publication date: 26 February 2009

Recommendations

• A subquadratic algorithm for computing the \(n\)-th Bernoulli number
• A multimodular algorithm for computing Bernoulli numbers
• Faster computation of Bernoulli numbers
• Sums of Powers of Integers
• 68.37 To compute sum of integers raised to powers

zbMATH Keywords

Bernoulli polynomial

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Bernoulli and Euler numbers and polynomials (11B68) Number-theoretic algorithms; complexity (11Y16)

Cited In (10)

• Identities on the weighted \(q\)-Bernoulli numbers of higher order
• Some new identities on the Bernoulli and Euler numbers
• A subquadratic algorithm for computing the \(n\)-th Bernoulli number
• A study on the integral of the product of several Bernoulli polynomials
• Derivation of identities involving Bernoulli and Euler numbers
• Umbral calculus associated with Bernoulli polynomials
• A note on nonlinear Changhee differential equations
• Symmetry identities of \(q\)-Bernoulli polynomials of the second kind
• Applications of umbral calculus associated with \(p\)-adic invariant integrals on \(\mathbb Z_p\)
• Some properties of the twisted Changhee polynomials and their zeros

This page was built for publication: The DC algorithm for computing sums of powers of consecutive integers and Bernoulli numbers

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