Mathematica 9 is now available

Wolfram Library Archive


Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings
Title

Fast Fibonacci Numbers
Author

C. Reiter
Journal / Anthology

The Mathematica Journal
Year: 1992
Volume: 2
Issue: 3
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/