On the sum of k-th powers in terms of earlier sums

From MaRDI portal
Publication:5081822



Abstract: For k a positive integer let Sk(n)=1k+2k+cdots+nk, i.e., Sk(n) is the sum of the first k-th powers. Faulhaber conjectured (later proved by Jacobi) that for k odd, Sk(n) could be written as a polynomial of S1(n); for example S3(n)=S1(n)2. We extend this result and prove that for any k there is a polynomial gk(x,y) such that Sk(n)=g(S1(n),S2(n)). The proof yields a recursive formula to evaluate Sk(n) as a polynomial of n that has roughly half the number of terms as the classical one.





Cited in
(28)








This page was built for publication: On the sum of \(k\)-th powers in terms of earlier sums

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