Prove series identity (Alternating reciprocal factorial sum)

  • I
  • Thread starter uart
  • Start date
  • #1
uart
Science Advisor
2,797
21
This alternating series indentity with ascending and descending reciprocal factorials has me stumped.
[tex] \frac{1}{k! \, n!} + \frac{-1}{(k+1)! \, (n-1)!} + \frac{1}{(k+2)! \, (n-2)!} \cdots \frac{(-1)^n}{(k+n)! \, (0)!} = \frac{1}{(k-1)! \, n! \, (k+n)} [/tex]
Or more compactly,
[tex] \sum_{r=0}^{n} ( \frac{(-1)^r}{(k+r)! \, (n-r)!} ) = \frac{1}{(k-1)! \, n! \, (k+n)} [/tex]

BTW. (Assume n,k integers, with [itex]n \ge 0[/itex] and [itex]k \ge 1[/itex].)

In this particular instance (for me), this series arises from a connection between the Gamma (Erlang) distribution and the Poisson distribution, where for certain parameters they represent the same probability scenario.
Specifically [itex]1 - poisson\_cdf(k-1,\lambda) = gamma\_cdf(x,k,\lambda) [/itex] at x=1. I know this is true, but if I try to prove it by doing a series expansion of each of those CDFs and equating coefficients, then I end up with the alternating series that has me stumped.

Has anyone seen that series before or know of any insights in how best to prove it?
 
Last edited:

Answers and Replies

  • #2
andrewkirk
Science Advisor
Homework Helper
Insights Author
Gold Member
3,928
1,492
Identities of that kind often yield to induction. In this case you'd need two inductions, one on k and one on n.
I'd take the base case of k=1, n=0 and observe the identity's truth for that - both sides equalling 1.
Then I'd try proving that if the identity holds for k=k', n=n' then it holds for k=k',n=n'+1 and also for k=k'+1,n=n'. The result would follow by induction.

Sometimes the nature of the induction step proof requires us to have already proven more than one base case, eg not only k=1,n=0 but also k=1,n=1 and k=1,n=2. But if such a requirement exists it will become apparent when trying to prove one or other of the induction steps. In that case, you'd need to prove the additional base cases to complete the proof.
 
  • #3
anuttarasammyak
Gold Member
1,056
479
Equation to be proved is transformed to
[tex](-)^k\sum_{r=0}^n \ _{n+k}C_{r+k} (-)^{r+k}=\ _{n+k-1}C_n[/tex]
Terms under summation are interpreted as coefficients of ##x^{n-r}## in expansion of ##(x-1)^{n+k}##. I hope such a transformation could be helpful.
 
Last edited:
  • #4
uart
Science Advisor
2,797
21
Thanks all. Yes I did try induction first up, but I didn't get anywhere with it.

That's a great approach anuttarasammyak, looks very promising.

And using the combinations property that,
[tex] _nC_r = \, _{n-1}C_r + \, _{n-1}C_{r-1}[/tex]
with the end condition that [itex] _nC_0 = \, _{n-1}C_0[/itex], I'm pretty sure I can make that whole LHS "telescope".
 
  • #5
uart
Science Advisor
2,797
21
Just sketching out a proof based on anuttarasammyak's insights.
[tex] \frac{1}{k! \, n!} + \frac{-1}{(k+1)! \, (n-1)!} + \frac{1}{(k+2)! \, (n-2)!} \cdots \frac{(-1)^n}{(k+n)! \, (0)!} = \frac{1}{(k-1)! \, n! \, (k+n)} [/tex]
Multiplying both sides by [itex](k+n)![/itex] puts the proposed identity into the following form.
[tex] _{n+k}C_n -\, _{n+k}C_{n-1} +\, _{n+k}C_{n-2} - \cdots (-1)^n \,\, _{n+k}C_{n-n}= \, _{n+k-1}C_n [/tex]
Using the relationship that, [itex] \, _nC_k = \, _{n-1}C_k + \, _{n-1}C_{k-1}[/itex] (for n,k >=1), the LSH can be written as,
[tex] [ _{n+k-1}C_n + \, _{n+k-1}C_{n-1}] - [ _{n+k-1}C_{n-1} + \, _{n+k-1}C_{n-2}] + \cdots (-1)^{n-1} [ _{n+k-1}C_1 + \, _{n+k-1}C_0] + (-1)^n [ _{n+k}C_0 ] [/tex]
Here the second binomial coefficient in each square bracketed term cancels with the first binomial coeff in the following bracketed term, so the series telescopes leaving just the very first coeff of, [itex]\, _{n+k-1}C_n[/itex], hence LHS = RHS.
 
  • Like
Likes anuttarasammyak

Related Threads on Prove series identity (Alternating reciprocal factorial sum)

  • Last Post
Replies
20
Views
52K
  • Last Post
Replies
5
Views
1K
Replies
8
Views
626
  • Last Post
Replies
14
Views
3K
  • Last Post
Replies
4
Views
2K
Replies
2
Views
4K
  • Last Post
Replies
6
Views
8K
  • Last Post
Replies
2
Views
2K
Replies
1
Views
693
  • Last Post
2
Replies
39
Views
3K
Top