> [!summary] A combinatorial proof is a type of proof where you show that an equation is equal in two ways. >[!info]+ Read Time **⏱ 1 min** # Definition A combinatorial proof is a type of proof where you show two expressions are equal by interpreting them as counting the same in two different ways. Often in combinatorial proof, you base arguments on logic and counting.