Summation of products of binomial coefficients So, I try to manipulate some series and this sum came up in the coefficients
$$\sum_{k=m}^{l-n+m}\binom{k}{m}\binom{l-k}{n-m}$$
whith $l\ge n$.
I've seen the identities of the binomial coefficients but I couldn't figure any way to simplify it. Any ideas?
 A: We have
$$ \sum_{k=m}^{l-n+m} \binom km \binom{l-k}{n-m}
= \begin{cases}
\binom{l+1}{n+1} &\text{if $0\le m\le n$} \\
0 &\text{otherwise}
\end{cases} $$
Here's the bulk of a proof by generating functions: equation (1.5.5) in generatingfunctionology gives
$$ \sum_{k=0}^\infty \binom kn x^k = \frac{x^n}{(1-x)^{n+1}} $$
if $n\ge 0$.  Thus
\begin{align*}
\sum_{l=0}^\infty
\left(\sum_{k=m}^{l-n+m} \binom km \binom{l-k}{n-m}\right)
x^{l+1}
&= x\left(\sum_{k=0}^\infty \binom km x^k\right)
\left(\sum_{k=0}^\infty \binom k{n-m} x^k\right) \\
&= x\cdot\frac{x^m}{(1-x)^{m+1}}\cdot\frac{x^{n-m}}{(1-x)^{n-m+1}} \\
&= \frac{x^{n+1}}{(1-x)^{n+2}} \\
&= \sum_{l=0}^\infty \binom l{n+1} x^l
\end{align*}
Now identify coefficients (noting that there's $x^l$ on one side and $x^{l+1}$ on the other).
(If you want a more elementary proof, I'd suggest looking at some proof of the well-known identity
$$ \sum_{k=n}^l \binom kn = \binom{l+1}{n+1} $$
(which is the case $m=n$ of your sum) and seeing if you can adapt the ideas.)
A: Let us consider $0 \le m \le n$ and count in two ways:
What is the number of ways of choosing $n+1$ balls in a set of $l+1$ balls? (the balls are enumerated 1,2,...,l+1)
On one hand, the answer is $\binom{l+1}{n+1}$. 
On the other hand, let $a_1 < a_2 <\cdots <a_{n+1}$ be a choice of numbers. Let count the number of choices of $n+1$ elements, where $a_{m+1}=k+1$: $\binom{k}{m} \cdot \binom{l+1-(k+1)}{n-m}$. So, follow that 
$\sum_{k=m}^{l-n+m}\binom{k}{m}\binom{l-k}{n-m}=\binom{l+1}{n+1}$
