The most ubiquitous expressions in combinatorics are combinations, otherwise known as binomial coefficients. These count the number of subsets with a particular cardinality of some finite set. In this video, we derive the formula for combinations using the formula for counting permutations and the $k$-to-$1$ correspondence principle.
