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

I dont know how to proceed with solving $$\sum_{i=1}^{n}i^{k}(n+1-i).$$ Please give advise.

share|cite|improve this question
@RossMillikan In the summand, the power is a constant... – David Mitra Apr 12 '12 at 16:07
@DavidMitra: You are correct. It is not a duplicate. – Ross Millikan Apr 12 '12 at 16:46
First, find two generating functions for $n^k$ and $1+n$. Then product of them. Next, get the coefficient of $x^n$. You need the eulerian number for the generating function of the sequence $n^k$. – hkju Apr 13 '12 at 15:54

You can factor out the $(n+1)$ to give $(n+1)\sum_{i=1}^n i^k-\sum_{i=1}^n i^{k+1}$ For positive integral $k$ you can use Faulhaber's formulas. What kind of $k$ are you considering?

share|cite|improve this answer


is same as


which looks like some combination of Eulerian number.

share|cite|improve this answer

$H_n^{(k)}=\sum_{i=1}^n i^{-k}$ is by definition the $n$-th harmonic number of order $k$. Thus, $$ \sum_{i=1}^n i^{k} (n+1-i) = (n+1) H_n^{(-k)}- H_n^{(-k-1)}. $$ I don't think it can be simplified further, at least considerably and for any $n$ and $k$. Is this what you meant by "solving"?

share|cite|improve this answer
Ross: observe that $k$ is not the summation index. – andreimf Apr 12 '12 at 16:03

This is a prefix sum of natural numbers. The solution to this is


share|cite|improve this answer

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.