Deriving the Formula for the Sum of the First n Integers Raised to a Power
2025-08-03
The problem we are addressing is how to derive the formula for the sum of the first n integers raised to an arbitrary but fixed power, specifically:
S(n) = 1^k + 2^k + 3^k + ... + n^k
Faulhaber's Formula
This formula is known as Faulhaber's formula, which expresses the sum of powers in a polynomial form. You can read more about it here.
Elementary Derivation
We can derive this formula using elementary math techniques, specifically leveraging telescoping sums and linear equations of partial sums.
Using Telescoping Sums
Consider the sum of powers:
∑i=1n (ik + 1 - (i - 1)k + 1) = nk + 1
When we expand (i - 1)k + 1 using the binomial theorem, we find that the highest term is ik + 1. Thus, the polynomial in i on the left-hand side has degree k.
This equation can be rearranged, allowing us to express the sum of ik we are looking for, provided we have the formulas for sums of powers up to k - 1 already.
For further details on this approach, visit here.
Direct Approach Using Linear Equations
Another method involves expressing the sum S(n) = 1k + 2k + ... + nk as a polynomial:
S(n) = ck + 1 * nk + 1 + ck * nk + ... + c1 * n + c0
Here, we can show that ck + 1 = 1 / (k + 1) and c0 = 0. The coefficients for the other terms can be found by solving a system of linear equations based on the first partial sums.
Example for k=3
To find the coefficients for k=3, we compute:
- S(1) = 13 = 1
- S(2) = 13 + 23 = 9
- S(3) = 13 + 23 + 33 = 36
Forming Linear Equations
Now we set up the equations:
c4 * 14 + c3 * 13 + c2 * 12 + c1 * 1 + c0 = 1 c4 * 24 + c3 * 23 + c2 * 22 + c1 * 2 + c0 = 9 c4 * 34 + c3 * 33 + c2 * 32 + c1 * 3 + c0 = 36
We already know c4 = 1/4 and c0 = 0. By simplifying these equations further, we can solve for the coefficients c3, c2, c1.
Conclusion
Using telescoping sums and solving linear equations, we can derive the formula for the sum of the first n integers raised to any power k. For more detailed steps and examples, see these references: Brilliant, Mathematics Stack Exchange, and Nick Schot on Medium.