Fibonacci Representations - Professor Peter Giblin OBE
23rd February 2019
Every positive integer has a unique representation as a sum of Fibonacci
numbers in which no two consecutive terms of the Fibonacci sequence 1, 2, 3, 5, 8, 13, ...
are used. I'll describe this system and apply it to a game with two piles of counters.
If there's time, we'll also demonstrate that 64 = 65 (almost).