Combinatorial proofs

A combinatorial proof demonstrates

that each side of an equation

corresponds to the size of the same set.

Contrast this to a conventional algebraic proof,

in which symbol manipulation is used to

carry one side to the other

Previous slide

Next slide

Back to first slide

View graphic version