Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
Discrete Mathematics
2010-12-02 v1 Number Theory
Abstract
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. Using a sqrt 5 conversion factor on Lucus numbers gives a faster Fibonacci algorithm. In addition, a fast simple recursive algorithm for individual Lucas numbers is given that is O(log n).
Keywords
Cite
@article{arxiv.1012.0284,
title = {Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers},
author = {L. F. Johnson},
journal= {arXiv preprint arXiv:1012.0284},
year = {2010}
}
Comments
5 pp