how to move the tower in the fewest moves: two rules, a worked example and a table
Built as a memo rather than a table: the thing worth hanging it up for reads across the room, with the full reference in smaller type below it.
Three sizes in one archive — from a sheet on the fridge to a poster on the wall.
Discs are numbered from the smallest (1). The tower starts on peg A and goes to C; B is the spare.
Halve the move number for as long as it stays whole: the number of halvings plus one is the disc that moves (the smallest is disc 1). Move 12: 12 → 6 → 3, twice — disc 3 moves. So the smallest moves on every odd move, and the largest only once, exactly halfway. In binary it is the count of trailing zeros: 12 = 1100₂.
Why the numbers can be trusted. Every countable number here is computed from data rather than typed in, and the sheet must pass 4 independent checks before it is allowed to build — how many items there are, the order they come in, and the claim in the highlighted box itself. If one fails, there is no file.
the IWF colour code and the plate count: from target weight to each side of the bar, no calculator
why a “yes” from a test that is right 99 times in 100 is wrong more than nine times in ten when one in a thousand has the thing
the first digit of a number: why a one turns up more than six times as often as a nine, and in which sets that is true
how many people it takes for two of them to share a birthday — and the same count for codes and fingerprints