# Binomial Coefficient with Self minus One

## Theorem

$\forall n \in \N_{>0}: \dbinom n {n - 1} = n$

## Proof 1

The case where $n = 1$ can be taken separately.

$\dbinom 1 0 = 1$

demonstrating that the result holds for $n = 1$.

Let $n \in \N: n > 1$.

From the definition of binomial coefficients:

$\dbinom n {n - 1} = \dfrac {n!} {\left({n - 1}\right)! \left({n - \left({n - 1}\right)}\right)!} = \dfrac {n!} {\left({n - 1}\right)! \ 1!}$

the result following directly from the definition of the factorial.

$\blacksquare$

## Proof 2

From Cardinality of Set of Subsets, $\dbinom n {n - 1}$ is the number of combination of things taken $n - 1$ at a time.

Choosing $n - 1$ things from $n$ is the same thing as choosing which $1$ of the elements to be left out.

There are $n$ different choices for that $1$ element.

Therefore there are $n$ ways to choose $n - 1$ things from $n$.

$\blacksquare$