Hacker News Reader

This is always possible, because 1 is a Fibonacci number.

That is true, the article skips the fact that the approximation using the initial fib numbers is not useful.

from the wiki page:

"Zeckendorf's theorem states that every positive integer can be represented uniquely 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."

so, distinct and non-consecutive

Non consecutive isn't surprising, any consecutive Fibonacci numbers in the sum can be replaced with their sum, which is itself a Fibonacci number by definition

That's not sufficient to be unsurprising.

What if a sum has more than 2 consecutive Fibonacci numbers? That doesn't cause a problem, but it takes a little more work to sort it out.

I find the distinct property much more interesting and non obvious.

It looks like non consecutivity is only there to force unique solutions hence called zeckendorf representations

Sure, but the conversion method does not require the numbers to be distinct or non-consecutive.

Reply on news.ycombinator.com