Subject: "fastfib" in the gf package faster than "fib"
From: Stavros Macrakis
Date: Tue, 8 Jul 2008 14:54:35 -0400
By the way, the n*log(n) algorithm you're probably thinking of,
Sch?nhage-Strassen (actually O(n*log(n)*log(log(n))), has a crossover
>> 10^10000. (http://en.wikipedia.org/wiki/Sch%C3%B6nhage-Strassen_algorithm).
By the way, on my generic laptop, Maxima currently multiples
10,000-digit numbers in about 1 mS and 10,000,000-digit numbers in
about 4 S -- not so bad for casual calculations.
-s