I've been working on analysing one system lately, I arrived to an expression which I'd like to simplify more, still couldn't manage to.
I arrived to the following expression : $\sum_{k = n+2}^{N+1}\gamma^k\prod_{t=n+2}^{k}(1-(t-n-1)\alpha); n \in N , \alpha \in R$, and $\gamma<1$.
I just included the sum operator for illustration.
What I'd like to know, if there's a way to write :
$\prod_{t=n+2}^{k}(1-(t-n-1)\alpha)$
in a more simplified way. I was thinking about the Gamma function, since this expression looks like a combination of factorials somehow to me, but didn't manage to figure out how can I arrive there.
Thank you
We can employ the Gamma function to get a convenient representation.
Comment:
In (1) we shift the index by $n+1$ to start with $t=1$.
In (2) we factor out $\alpha^{k-n-1}$.
In (3) we use the definition of binomial coefficients for $\beta \in \mathbb{C}, q\in \mathbb{N}$ \begin{align*} \binom{\beta}{q}=\frac{\beta(\beta-1)\cdots(\beta-q+1)}{q!} \end{align*}
In (4) we use the identity $\binom{\beta}{q}=\frac{\Gamma\left(\beta+1\right)}{\Gamma\left(\beta - q + 1\right)\Gamma\left(q+1\right)}$.