|
Zeckendorf's theorem, named after Belgian mathematician Edouard Zeckendorf, is a theorem about the representation of integers as sums of Fibonacci numbers. Zeckendorf's theorem states that every positive integer can be represented in a unique way as the sum of one or more distinct Fibonacci numbers in such a way that the sum does not include any two consecutive Fibonacci numbers. A sum that meets these conditions is called a Zeckendorf representation. This can be stated as, where is the nth Fibonacci number and for . For example, the Zeckendorf representation of 100 is 100 = 89 + 8 + 3 There are other ways of representing 100 as the sum of Fibonacci numbers - for example 100 = 89 + 8 + 2 + 1 100 = 55 + 34 + 8 + 3 but these are not Zeckendorf representations because 1 and 2 are consecutive Fibonacci numbers, as are 34 and 55. For any given positive integer, a representation that satisfies the conditions of Zeckendorf's theorem can be found by using a greedy algorithm, choosing the largest possible Fibonacci number at each stage. It is more difficult to show that this representation is unique i.e. it is the only representation that satisfies these conditions.
Fibonacci multiplication One can define the following operation on natural numbers a, b: given the Zeckendorf representations and we define the Fibonacci product . For example the Zeckendorf representation of 1 is (since is disallowed from representations) so . Don Knuth proved the surprising fact that this operation is associative. See also . Reference: D. E. Knuth, Fibonacci multiplication, Appl. Math. Lett. 1 (1988), 57–60 See also | ||||||||
|
| |||||||||
 |
|
| |