- 1,442
- 191
Put
The desired result is an evaluation of the sum
and so it is important that the evaluation of I_n(x) be not by means of partial fraction decomposition, for this is already of note that S_n(x) may be evaluated, that is to say: it is known to me that
whence integrating once again will produce an evaluation for S_n(x).
I was working on developing a recurrence relation for I_n(x) that I may solve it via generating functions; here of note is that it is also known to me that
I_{n+1}(x)=I_n(x)-I_n(x+1)
yet this is not useful to that end. What is desired is a non-homogeneous recurrence. Any thoughts?
I_n(x)=\int \frac{n!dx}{x(x+1)\cdots (x+n)}
The desired result is an evaluation of the sum
S_n(x)=\sum_{k=0}^{n}(-1)^{k}\left(\begin{array}{c}n\\k\end{array}\right) (x+k)\log (x+k)
and so it is important that the evaluation of I_n(x) be not by means of partial fraction decomposition, for this is already of note that S_n(x) may be evaluated, that is to say: it is known to me that
\int\frac{n!dx}{x(x+1)\cdots (x+n)}=\int\sum_{k=0}^{n}\left(\begin{array}{c}n\\k\end{array}\right) \frac{(-1)^k}{x+k}dx = \sum_{k=0}^{n}\left(\begin{array}{c}n\\k\end{array}\right) (-1)^{k}\log (x+k)+C
whence integrating once again will produce an evaluation for S_n(x).
I was working on developing a recurrence relation for I_n(x) that I may solve it via generating functions; here of note is that it is also known to me that
I_{n+1}(x)=I_n(x)-I_n(x+1)
yet this is not useful to that end. What is desired is a non-homogeneous recurrence. Any thoughts?
Last edited: