Counting the same thing twice — page 2
Two trees, and every edge in exactly one of them
Euler's formula is usually proved by deleting things until nothing is left. There is a better argument that deletes nothing — a tree through the corners and a tree through the faces, which between them use every edge once and can therefore be counted.
TopologySeven hundred and twenty degrees of gap
Unfold the faces around any corner of a solid and they do not close up. The gap left over is different at every corner and on every solid, and the gaps always add to two full turns.
ProbabilityThe path folded at its first touch
Counting the walks that touch a line looks like a question about a walk's whole history. Fold each one where it first touches, and it becomes a question about where walks end up — which is a binomial coefficient, and is already known.
AnalysisWhere the coefficients come from
The recipe for a square wave has a four over pi in front and a one over three on the second term, and the first rung of this ladder used them without saying where they came from. They come from multiplying by one harmonic and taking the area.
DiscreteCounting the colourings
Asking whether a graph can be coloured with four colours gives a yes or a no. Asking how many ways there are gives a polynomial — and the polynomial answers the first question, and several others nobody asked.