Showing cs.DMShow all
2 papers · 1 filter
cs.DM2010
Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
L. F. Johnson
A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Usin…
cs.DM2010
Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci
L. F. Johnson
Two very fast and simple O(lg n) algorithms for individual Fibonacci numbers are given and compared to competing algorithms. A simple O(lg n) recursion is derived that can also be…