Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers

Details Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers

2010-12-01

arxiv.org/abs/1012.0284v1

Computer Science

Discrete Mathematics

5 pp

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602238