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

preprint2020arXivOpen access

Abstract

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

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.