Fast Fibonacci Numbers -- from Wolfram Library Archive

Title

Fast Fibonacci Numbers

Author

C. Reiter

Journal / Anthology

The Mathematica Journal

Year:

1992

Volume:

Issue:

Page range:

58-60

Description

A recursive formula giving the Fibonacci number f2n in terms of fn and fn-1 forms the basis for efficient computation of large Fibonacci Numbers. Mathematica can be used to derive other recursive formulas that generalize this "reduction by halves." The additional formulas lead to algorithms that improve performance in certain cases.

Subject

Mathematics > Number Theory

URL

http://www.mathematica-journal.com/issue/v2i3/

Enable JavaScript to interact with content and submit forms on Wolfram websites. Learn how »