Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

IPL
2000

favoriteEmaildiscussreport

97views more IPL 2000»

A fast algorithm for computing large Fibonacci numbers

13 years 10 months ago

A fast algorithm for computing large Fibonacci numbers

Download www.ii.uni.wroc.pl

We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci number Fn. We show that the number of bit operations in the conventional product of Lucas numbers algorithm can be reduced by replacing multiplication with the square operation.

Daisuke Takahashi

Real-time Traffic

Bit Operations | Fibonacci Number | IPL 2000 | Lucas Numbers |

claim paper

Related Content

» Thin heaps thick heaps

» Fast Fibonacci Encoding Algorithm

» Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Wor...

» GPUbased Fast Ray Casting for a Large Number of Metaballs

» Distributed algorithms for ultrasparse spanners and linear size skeletons

» FIT A Fast Algorithm for Discovering Frequent Itemsets in Large Databases

» Fast Parallel Molecular Algorithms for DNAbased Computation Factoring Integers

» Power Series Composition and Change of Basis

» A Fast Parallel Clustering Algorithm for Large Spatial Databases

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	IPL
Authors	Daisuke Takahashi

Comments (0)