Chapter 4 combinatorial arguments

The four that are designated as possibly on the test start with a (T). The philosophy of a combinatorial proof is that we do not dwell on the numbers we are looking at (or the formulas representing the numbers) but rather we think about the structures (i.e. various sets) that we know have that many elements. By setting up correspondences between such structures we establish relationships between the corresponding formulas.