From: Nuralanur@...
Date: 2006-05-28T00:58:31+09:00
Subject: Re: Fast Fibonacci method

-------------------------------1148745502
Content-Type: text/plain; charset="US-ASCII"
Content-Transfer-Encoding: 7bit

Dear Erlercw,
 
if you want to implement the Fibonacci calculation to show some
benchmark using the recurrence formula F_{n+2}=F_{n+1}+F_{n},
this isn't for you.
 
But I'd bet  that the formula 1.3.3 in
 
_http://www.math.upenn.edu/~wilf/gfology.pdf_ 
(http://www.math.upenn.edu/~wilf/gfology.pdf) 
 
is faster (on any machine/computer language ) as it involves  multiplying the
same factors all the time. One could just do one multiplication
using logarithms, actually, and then convert back the result.
 
Best regards,
 
Axel 
 
 

-------------------------------1148745502--