how to write any positive whole number as a sum of Fibonacci numbers, no two of them neighbours
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.
Fibonacci numbers here: 1, 2, 3, 5, 8, 13… — a single 1, and from 3 on each is the sum of the two before it. The code 1000010100 reads 89 + 8 + 3.
Edouard Zeckendorf, a Belgian army doctor and amateur mathematician, proved that every positive whole number has only one sum of distinct, non-neighbouring Fibonacci numbers. He found it in 1939 but published it only in 1972, twenty years after the Dutch mathematician Gerrit Lekkerkerker had.
Why the numbers can be trusted. Every countable number here is computed from data rather than typed in, and the sheet must pass 3 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