In mathematics, the term combinatorial proof is often used to mean either of two types of mathematical proof: A proof by double counting. A combinatorial identity is proven by counting the number of elements of some carefully chosen set in two... Wikipedia