Get the latest tech news
Indian native rediscovers Department of Defense 1963 Algorithm
Notation: Given an integer $N$, we find its Zeckendorf representation as the sum of non-consecutive Fibonacci numbers. By the Zeckendorf theorem, this representation is unique. Let $\zeta_N$ denote...
The fact that the scatterplot shows some points (asymptotically) closer to$\sqrt{N}$ means that this may still have worst case behavior in$O(\sqrt{N})$ i.e., no better than trial division. (Update after testing): This doesn't necessarily work as it also skips over the GCD computation on the sequence elements resulting in sub-optimal number of iterations. The good news is every positive integer has a weighted Fibonacci squares sum decomposition.
Or read this on Hacker News