Prove $$ \sum_{k=0}^n \binom{m+k}{m} = \binom{m+n+1}{m+1} $$ by considering the coefficient of $x^n$ in $(1-x)^{-1} (1-x)^{-m-1} = (1-x)^{-m-2}$.
I have succeeded in proving this using induction and in a combinatorial way, but I need to practice with power series.
Background: third year mathematics at university
My attempt
The given equality can be rewritten as
$$ \left( \sum_{k=0}^\infty \binom{-1} k (-x)^k \right) \left( \sum_{\ell=0}^\infty \binom{-m-1}{\ell} (-x)^\ell \right) = \sum_{n=0}^\infty \binom{-m-2}{n} x^n (-1)^n $$
and we can work out the left-hand side as
$$ \sum_{n=0}^\infty \sum_{k+\ell=n} \binom{-1}{k} \binom{-m-1}{\ell} (-x)^{k+\ell} = \sum_{n=0}^\infty \sum_{k=0}^n \binom{-1}{k} \binom{-m-1}{n-k} x^n (-1)^n $$
and now we equate the coefficients in front of $x^n$ on both sides to get
$$ \sum_{k=0}^n \binom{-1}{k} \binom{-m-1}{n-k} = \binom{-m-2}{n}. $$
But how to proceed? Because I don't see the original equation in this.