# $k$-to-$1$ Correspondences

A powerful idea in combinatorics is to produce a map from one finite set to another in such a way that the preimage of every element of the range has a uniform number of elements. This is called a $k$-to-$1$ correspondence. An example of where this comes in handy is in proving the formula for combinations, otherwise known as binomial coefficients.