I am looking for ways to simplify the sum $$\sum_{k=1}^n \frac{k!}{(k+a)!}=\sum_{k=1}^n \frac{\Gamma(k+1)}{\Gamma(k+1+a)}$$ where $n\in\mathbb N$, $a>0$ is a real parameter, and $\Gamma$ denotes the Gamma function.
-
What kind of simplification are you looking for? :) – Severin Schraven Feb 08 '20 at 01:58
-
Hi @Severin, I think the identity in my answer below that I just added is really cool – Maximilian Janisch Feb 08 '20 at 02:00
-
Can you explain a bit how you came to that question (or if it is too lengthy, explain it at university)? – Severin Schraven Feb 08 '20 at 02:02
-
@SeverinSchraven There is no (immediate) application to it, it was inspired by this question, where the author was asking in essence for the series $\sum_{k=1}^\infty \frac{k!}{(k+a)!}$. Also, I knew about the method described below because I will attend this seminar. I am looking forward to seeing you at uni next semester! PS: I think it is funny how we always meet at 3am on MSE – Maximilian Janisch Feb 08 '20 at 02:08
-
1Ahhh I see. I'm sure it is a fun seminar. Unfortunately, there are too many interesting things going on, so I will probably not join. PS: Well, 3am is a good time to have a relaxed conversation about math ;) – Severin Schraven Feb 08 '20 at 02:14
2 Answers
If $a=1$ you will get the harmonic numbers. Suppose $a\neq1$. Let $t_n=\frac{\Gamma(n+1)}{\Gamma(n+1+a)}$. We are looking for $$s_n=\sum_{k=0}^{n-1} t_k.$$
In view of Gosper's algorithm, I will look for a hypergeometric term $z_n$ satisfying $z_{n+1}-z_n=t_n$. My approach here is described thoroughly in the book A=B (by Marko Petkovsek, Herbert Wilf and Doron Zeilberger.)
Indeed then we have $z_n-z_0=s_n$ and we are done. Let $$y:\mathbb N\to\mathbb R, y(n)=y_n$$ be a rational function such that $z_n = y_n t_n$. Then $y_n$ satisfies $r_n y_{n+1}-y_n=1$, where I have defined $r_n=\frac{t_{n+1}}{t_n}=\frac{n+1}{n+1+a}$.
Indeed this means that we get the recurrence relation $$y_{n+1}=\frac{1+n}{1+n+a}+\frac{1+n}{1+n+a} y_n.$$
This linear recurrence relation of first order can be solved as in here, with a particular solution (note that the initial condition doesn't matter) being $$y_n=\frac{a+n-\frac{(a+1) a \Gamma (a+n+1)}{\Gamma (a+2) \Gamma (n+1)}}{1-a}.$$
Indeed this implies $$z_n = y_n t_n =-\frac{\Gamma (n+1) \left(-\frac{(a+1) a \Gamma (a+n+1)}{\Gamma (a+2) \Gamma (n+1)}+a+n\right)}{(a-1) \Gamma (a+n+1)}=\frac{\frac{a (a+1)}{\Gamma (a+2)}-\frac{(a+n) \Gamma (n+1)}{\Gamma (a+n+1)}}{a-1}$$
and hence $$z_n=\frac{\Gamma (a+n)-\Gamma (a) \Gamma (n+1)}{(a-1) \Gamma (a) \Gamma (a+n)}.$$
In particular, $z_0=0$ and thus $$\bbox[15px,border:1px groove navy]{\sum_{k=0}^{n-1} \frac{k!}{(k+a)!}=s_n=z_n=\frac{\Gamma (a+n)-\Gamma (a) \Gamma (n+1)}{(a-1) \Gamma (a) \Gamma (a+n)}.}$$
We can also deduce $$\bbox[15px,border:1px groove navy]{\sum_{k=1}^n \frac{k!}{(k+a)!}=s_{n+1}-t_0=\frac{\Gamma (a+n+1)-\Gamma (a+1) \Gamma (n+2)}{(a-1) \Gamma (a+1) \Gamma (a+n+1)}.}$$
In particular, by this answer, as $n\to\infty$ for $a>1$ fixed, the sum is $$\frac1{(a-1)\Gamma(a+1)}+O(1/n).$$

- 13,536
Following almost @Maximilian Janisch's steps, I arrived to a different result, namely $$\sum_{k=1}^n \frac{k!}{(k+a)!}=\frac 1{a-1}\left(\frac{1}{\Gamma (a+1)}-\frac{\Gamma (n+2)}{\Gamma (n+a+1)} \right)$$

- 260,315