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.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Bernouli's Formula for sum of kth powers of first n natural numbers is given by: $$f_k(n)=\frac{1}{k+1}\sum_{j=0}^k{k+1\choose j}B_j(n+1)^{k+1-j}$$ where $Bj$ is the $j^{th}$ Bernoulli Number and is in a sense recursively given by:$$B_j=-\frac{1}{j+1}\sum_{i=0}^{j-1}{j+1 \choose i}B_i$$.

I did find a generalized proof of this for Generalized case where powers can be complex numbers. I am looking for simpler proofs. Do you have any idea if this can be proved by induction.

Thank you.

PS. I am not sure of tags and appreciate if they are corrected.

Added By simpler I mean that do involve only integer powers.

share|cite|improve this question
Hint: use Gamma function evaluad on Gauss interger! – MathOverview Jan 5 '13 at 19:03
Section 7.6 of Graham, Knuth, & Patashnik, Concrete Mathematics, has a proof via exponential generating functions that isn’t too ugly. – Brian M. Scott Jan 5 '13 at 19:05
@Elias, I am not sure what you mean. I am not looking for proofs involving complex powers. and Brian, thanks, I will try to have a look at it. – 007resu Jan 5 '13 at 19:20
up vote 3 down vote accepted

The proof using the generating function: $$\frac{t}{e^t-1}$$ Can be found here. In essence, the proof follows from noting that: $$e^{kt}=\sum k^m \frac{t^m}{m!}$$ So that the sum $\ \sum k^m$ is related to the sum of the geometric series which is in turn related to the generating function.

share|cite|improve this answer
And of course plant math has the proof as well: – nbubis Jan 5 '13 at 20:30

Your Answer


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.