Suppose that \(m\) and \(n\) are integers, with \(0 \leq m \leq n .\) The binomial
coefficient \(\left(\begin{array}{l}n \\ m\end{array}\right)\) is the
coefficient of \(t^{m}\) in the expansion of \((1+t)^{n} ;\) that is,
$$
(1+t)^{n}=\sum_{m=0}^{n}\left(\begin{array}{l}
n \\
m
\end{array}\right) t^{m}
$$
From this definition it follows immediately that
$$
\left(\begin{array}{l}
n \\
0
\end{array}\right)=\left(\begin{array}{l}
n \\
n
\end{array}\right)=1, \quad n \geq 0
$$
For convenience we define
$$
\left(\begin{array}{r}
n \\
-1
\end{array}\right)=\left(\begin{array}{c}
n \\
n+1
\end{array}\right)=0, \quad n \geq 0
$$