Combinatorial Proof

A combinatorial proof of an identity is a proof that uses counting arguments to prove that both sides of he identity count the same objects but in different ways, or a proof that is based on showing that there is a Bijection between the sets of objects counted by the two sides of the identity.