The Mathematica Journal

Search

About the Journal
Current Issue
Editorial Policy
Submissions
Back Issues
Contact Information

index.html

Fast Fibonacci Numbers

Volume 2, Issue 3
Summer 1992
Clifford A. Reiter, Lafayette College
 

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.

     
About Mathematica 
© Wolfram Media, Inc. All rights reserved.