Zeckendorf's theorem states that every positive integer can be uniquely represented as a sum of one or more distinct non-consecutive Fibonacci numbers.
Articles by others on the same topic
Every positive integer is a unique sum of nonconsecutive Fibonacci numbers, using the sequence with one copy of . The greedy procedure selects the largest allowable Fibonacci number and repeats on the remainder.