Please provide a combinatorial proof for the following:
Prove the identity $$\sum_{i=0}^{k}{m+k-i-1 \choose k-i}{n+i-1 \choose i}={m+n+k-1 \choose k}$$
Hint: use idea of "selection with repetition".
Please provide a combinatorial proof for the following:
Prove the identity $$\sum_{i=0}^{k}{m+k-i-1 \choose k-i}{n+i-1 \choose i}={m+n+k-1 \choose k}$$
Hint: use idea of "selection with repetition".
Imagine you have $m$ red objects and $n$ blue objects, and you want to select $k$ objects with possible repetitions. This can be done (as you stated yourself in the comment) in
$$\binom{m+n+k-1}{k}$$
different ways.
On the other hand, among these $k$ selected objects, there could be exactly $k$ red ones and $0$ blue ones, there could be $k-1$ red and $1$ blue, etc. Each of these cases are mutually exclusive, and there are
$$\binom{m+(k-i)-1}{k-i} \binom{n+i-1}{i}$$
ways to choose exactly $k-i$ red objects and $i$ blue objects. Sum over all $i$ and you get your identity.