alternative proof to induction, binomial sum identity 
$\displaystyle \sum_{q=0}^{k} \begin{pmatrix}n-1+q\\ n-1  \end{pmatrix} = \begin{pmatrix}n+k\\n \end{pmatrix} $

 induction 
$\begin{pmatrix}n \\ k  \end{pmatrix} := \frac{n!}{(n-k)!k!}$ 
Beginning of induction : $k=0 \rightarrow \begin{pmatrix} n-1 \\ n-1 \end{pmatrix} = \begin{pmatrix} n \\ n \end{pmatrix} = 1 $
Induction step : $k\rightarrow k+1: \sum_{q=0}^{k+1} \begin{pmatrix} n-1+q\\n-1 \end{pmatrix} = (\sum_{q=0}^{k} \begin{pmatrix} n-1+q\\n-1 \end{pmatrix}) + \pmatrix{n-1+k+1\\n-1} $
$\displaystyle = \begin{pmatrix}n+k \\ n \end{pmatrix} + \begin{pmatrix} n+k \\ n-1  \end{pmatrix} = \frac{(n+k)!}{k!(n)!}+ \frac{(n+k)!}{(k+1)!(n-1)!} =$
$\displaystyle =\frac{(n+k)!(k!n!+(k+1)k!(n-1)!}{k!n!(k+1)!(n-1)!} = \frac{(n+k)!(n+k+1)}{n!(k+1)!} = \begin{pmatrix}n+k+1 \\ n \end{pmatrix}$ 

 Do you know any other way to show this? Please do tell.

Another way is to use snake oil:
$\begin{align}
\sum_{n \ge 1} z^n \sum_{0 \le q \le k} \binom{n + q - 1}{n - 1}
  &= \sum_{0 \le q \le k} 
       z^{1 - q} \sum_{n \ge 1} \binom{n + q - 1}{q} z^{n + q - 1} \\
  &= \sum_{0 \le q \le k}
       z^{1 - q} \sum_{s \le 0} \binom{s}{q} z^s \\
  &= \sum_{0 \le q \le k}
       z^{1 - q} \frac{z^q}{(1 - z)^{q + 1}} \\
  &= \frac{z}{1 - z} \sum_{0 \le q \le k} (1 - z)^{-q} \\
  &= \frac{z}{1 - z} \frac{1 - (1 - z)^{-k - 1}}{1 - (1 - z)^{-1}} \\
  &= \frac{1}{(1 - z)^{k + 1}} - 1
\end{align}$
Now we want the coefficient of $z^n$:
$\begin{align}
[z^n] \frac{1}{(1 - z)^{k + 1}}
  &= (-1)^n \binom{-k - 1}{n} \\
  &= \binom{n + k + 1 - 1}{k + 1 - 1} \\
  &= \binom{n + k}{k} \\
  &= \binom{n + k}{n}
\end{align}$
