I'm required to prove the following binomial identity:
$$\sum\limits_{k=0}^l {n \choose k} {m \choose l-k} = {n+m \choose l}$$
I tried various arrangements but reached nowhere. Finally I turned to the hint in the book, which says
Apply the binomial theorem to $(1+x)^n (1+x)^m$
And suddenly, it makes sense. All I now need to do is add the powers on the right-hand side and equate the coefficients of $x^l$. But I'm wondering how to write a proper proof. Will it be enough if I say:
$(1+x)^n (1+x)^m = (1+x)^{m+n}$
Applying the binomial theorem separately for the two terms on the LHS and collecting the coefficients of $x^l$ on both sides, we have:
$${n \choose 0} {m \choose l} + {n \choose 1} {m \choose l-1} + \ldots + {n \choose l}{m \choose 0} = {n+m \choose l}$$
Is this enough? I don't know why but it looks rather shallow to me.
Other proof is counting in two ways: what the number of choose $l$ balls in $m+n$? (the balls are enumerate -- 1,2,...,m+n)
for one side: $\binom{m+n}{l}$
for other side: divided the balls into 2 groups, group 1 with $n$ balls and group 2 with $m$ balls. If we choose $k$ balls in group 1, we should choose $l-k$ balls in group 2. So, we have $\sum\limits_{k=0}^l {n \choose k} {m \choose l-k} = {n+m \choose l}$