Combinatorial argument for an identity Consider the following equation:
$x_1 + x_2 + \cdots + x_r = n,~~$ where $~~0\leq x_{i}\leq n, \forall i$
The number of integral solutions to the above equation = ${n+r-1 \choose r-1}$.
Consider the following result:
$\Sigma_{n=0}^{N} {n+r-1\choose r-1} = {N+r \choose r}$
The above result can be proved using induction. Is there an algebraic way of proving the above result? More importantly, is there an intuitive "combinatorial argument" that justifies the above result?

Regarding your second question, $\binom{N+r}{r}$ is the number of outcomes of selecting $r$ integers from $\{1,2,\ldots,N+r\}$. Suppose we want to organize these outcomes by the maximum integer selected. To count the number of outcomes whose maximum integer is $n+r$, then we need to select $r-1$ other integers from $\{1,\ldots, n+r-1\}$, so there are $\binom{n+r-1}{r-1}$ such outcomes. Adding up over all possible maximums $r,r+1,\ldots,N+r$, we have $\sum_{n=0}^N \binom{n+r-1}{r-1}$.

To see the connection to your first question, see the hint by Johannes. To count all possible ways to satisfy $x_1+\cdots+x_r=n$, you can organize them by the possible ways $x_1+\cdots+x_{r-1} \le n$.
