Abstract
For a positive integer let , i.e., is the sum of the first -th powers. Faulhaber conjectured (later proved by Jacobi) that for odd, could be written as a polynomial of ; for example . We extend this result and prove that for any there is a polynomial such that . The proof yields a recursive formula to evaluate as a polynomial of that has roughly half the number of terms as the classical one.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.