Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

It is known that exists recurrent formula for counting $$S_m(n)=\sum_{i=1}^{n}i^m,S_0(n)=n,m>0$$ I am intrested if such formulas exists for $m<0$

share|cite|improve this question
This MSE link treats the case $m=-2$. – Marko Riedel Apr 25 '14 at 22:13
up vote 1 down vote accepted

Newton's identities relate via recurrence formulae the powers sums $\sum_{i=1}^{n} x_{i}^{j}$ to the elementary symmetric functions in the variables $x_{i},$ which are (up to a uniquely determined sign in each case) the coefficients of the powers of $t$ in the polynomial $\prod_{i=1}^{n} (t-x_{i}).$ You can then evaluate the $m$-th power sum setting each $x_{i} = i^{-1}$ to obtain one answer to your question.

share|cite|improve this answer
Can you show how to apply Newton identities for example in case $m=-1,-2,...$ – Adi Dani Jan 10 '13 at 13:20
$H_{n,m}=\sum_{k=1}^n \frac{1}{k^m}=\sum_{k=1}^n k^{-m}=S_{-m}(n),m>0$ is generalized harmonic number – Adi Dani Jan 10 '13 at 13:45
Newton's identities work for any values of the variables, since they are polynomial identities. That is why you can work with $x_{i} = i^{-1}$ instead of $x_{i} = i,$ and then you have taken care of negative values of $m.$ – Geoff Robinson Jan 10 '13 at 15:32

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.