Zeckendorf's theorem
= Zeckendorf's theorem
{c}
Every <positive integer> is a unique sum of nonconsecutive <Fibonacci numbers>, using the sequence $1,2,3,5,8,\ldots$ with one copy of $1$. The greedy procedure selects the largest allowable <Fibonacci number> and repeats on the remainder.