$ {n \choose k} = {n \choose n-k} $
One way to easily prove that is to just look at Pascal's triangle which is a visual representation of these functions. And through the properties of symmetry that the triangle possesses it is apparent that this equation holds true since one element will always equal its opposite element on that row.
