Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sorry for the remedial math but:

Can someone tell me how to get a closed form for

$$\sum_{k=1}^n k^x$$

For $x = 1$, it's just the classic $n(n+1)/2$. What is it for $x > 1$?

share|improve this question
    
Is x intended to be an integer? –  Rick Decker Jun 7 '12 at 14:47
    
as far as i know there is no such a general formula to calculate $\sum_{k=1}^{n}k^x$ even for $x$ is an integer; –  Abdelmajid Khadari Jun 7 '12 at 14:48
2  
If $x$ is an integer, then Faulhaber's formula is what you're looking for. I believe this question has been asked before, but I can't find the duplicate. –  Zev Chonoles Jun 7 '12 at 14:50

1 Answer 1

up vote 16 down vote accepted

The general formula is fairly complicated:

$$\sum_{k=1}^n{k^x} = {1\over x+1}\sum_{k=0}^x{{x+1\choose k}B_k n^{x+1-k}}$$

Where $B_k$ are the Bernoulli numbers.

This is commonly called "Faulhaber's formula", but that is a misattribution. The Donald Knuth paper "Johann Faulhaber and sums of powers" explains the history in some detail, including what Faulhaber did and did not know. In particular, he did not know the general formula above, although he did work on many special cases.

For the special case of $x=2$ we have:

$$\sum_{k=1}^n{k^2} = {\frac 16}(2n^3+3n^2+n)$$

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.