Python Development, memoized functions.

[Alec Mihailovs]

From: "Antti Karttunen" <antti.karttunen at gmail.com>
>
> Yes, I guess the Binet's formula is the way to do it in real life? 
> (Provided that the system's
> floating point implementation gives accurate values for the required 
> range!)

As far as I recall, Carl Devore posted a couple of years ago in the Maple 
newsgroup, a Maple procedure based on formulas F(2n) = F(n+1)^2 - F(n-1)^2
and F(2n+1) = F(n+1)^2 + F(n)^2. That may be faster than the Binet's 
formula.

Alec