I have to prove equality with falling factorials $$(n)^{\underline{k}} = n(n-1)\cdots(n-k+1) $$ and rising factorials $$(n)^{\overline{k}}=n(n+1)\cdots(n+k-1)$$
Show: $$(n)^{\overline{k}}=(n+k-1)^{\underline{k}}= (-1)^k \cdot(-n)^{\underline{k}}$$
Can anyone please give me a hint? I tried so many ways but it got nowhere...my tries:
$$(n+k-1)^{\underline{k}}=(n+k-1)(n+k-2)...(n+k)$$ $$(-n)^{\underline{k}}=-n(-n-1)...(-n-k+1)$$
It is also convenient to use the product symbol to explicitly see the lower and upper limit. We have \begin{align*} \color{blue}{n^{\overline{k}}}&=n(n+1)\cdots(n+(k-1) \color{blue}{=\prod_{j=0}^{k-1}(n+j)}\tag{1}\\ \color{blue}{n^{\underline{k}}}&=n(n-1)\cdots(n-(k-1)) \color{blue}{=\prod_{j=0}^{k-1}(n-j)}\tag{2} \end{align*}
Comment:
In (3) we use the product representation (1).
In (4) we change the order of multiplication by replacing the index $j$ with $k-1-j$. \begin{align*} \prod_{j=0}^{k-1}(n+j)&=(n+0)(n+1)\cdots (n+k-2)(n+k-1)\\ &=(n+(k-1))(n+(k-2))\cdots(n+1)(n+0)\\ &=\prod_{j=0}^{k-1}(n+(k-1-j)) \end{align*}
In (5) we use (2) with $n$ substituted by $n+k-1$.
In (6) we factor out $(-1)$ $k$ times.
In (7) we use (2) with $n$ substituted by $-n$.