Combinatorial proof

A proof of an identity that interprets both sides as counts of the same finite set of objects, establishing their equality by counting those objects in two ways.

Connect