Sums of powers of integers—A review

DOI10.1080/0020739930240611zbMath0806.11015OpenAlexW2087995526MaRDI QIDQ4299912

T. C. T. Kotiah

Publication date: 15 August 1994

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739930240611

zbMATH Keywords

algorithmssum of powers of integersFaulhaber polynomials

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Farey sequences; the sequences (1^k, 2^k, dots) (11B57)

Related Items (2)

Unnamed Item ⋮ Generalized Stirling numbers and sums of powers of arithmetic progressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 68.37 To compute sum of integers raised to powers
• An Algorithm for Sums of Integer Powers
• Some Algorithms for the Sums of Integer Powers
• Sums of powers of integers: a little of the history
• Sums of Powers of Integers

This page was built for publication: Sums of powers of integers—A review