3

Is there a general formula for

$\sum_{k=1}^n\frac{1}{k(k+1)...(k+m)}$?

I know that the limit is $\frac{1}{mm!}$ but is there a combinatorial expression for this?

Martin Sleziak
  • 53,687
Averroes2
  • 1,147
  • Your right. $k$ has to start with $1$. Edited. – Averroes2 Nov 07 '16 at 12:54
  • are you looking for an algebraic formula or for a combinatorial argumentation of that? – G Cab Nov 07 '16 at 12:56
  • In fact I found something in between: $\frac{1}{a}(\frac{1}{1^{\bar{a}}}-\frac{1}{(n+1)^{\bar{a}}})$, where $n^{\bar{a}}=n(n+1)...(n+a-1)$. And its works! Is there another combinatorial? – Averroes2 Nov 07 '16 at 13:04
  • If you're asking for an expression of the sum: $$ \sum_{k=1}^n \frac{1}{k(k+1)\cdots(k+m)} = \sum_{k=1}^n \frac{(k-1)!}{(k+m)!} = \frac{1}{mm!} - \frac{n!}{m(m+n)!}$$ – sTertooy Nov 07 '16 at 13:08
  • Thank you. This is the same i found. Is there a combinatorial as well? – Averroes2 Nov 07 '16 at 13:11
  • Why does this solution not satisfy you ? – Peter Nov 07 '16 at 13:12
  • Yes, but I have the feeling that there must be a combinatorial expression - I mean something with binomial coefficients. – Averroes2 Nov 07 '16 at 22:34

1 Answers1

1

$$ \sum_{k=1}^n \frac{1}{k(k+1)\cdots(k+m)} = \frac1m\sum_{k=0}^n \frac{(k + m) - k}{k(k+1)\cdots(k+m)} \\ = \frac1m\sum_{k=1}^n \left[ \frac{1}{k(k+1)\cdots(k+m-1)} - \frac{1}{(k+1)(k+2)\cdots(k+m)}\right] $$

This is a telescoping sum. The result then is

$$ -\frac1m\left[ \frac{1}{(n+1)(n+2)\cdots(n+m)} - \frac{1}{1\cdot 2\cdots m}\right ] \\ = -\frac1m\left[ \frac{n!}{(m+n)!} - \frac{1}{m!}\right] \\ = \frac{1}{mm!} - \frac{n!}{m(m+n)!} $$

Nilabro Saha
  • 1,703