Richard Fateman wrote on 04/09/2006 12:40:27 PM:
> For GCL, this program is faster than the much longer one used in Maxima
> (defined in ASUM.lisp.).
Somewhat related: The latest Mathematical Monthly has some fancy
algorithms for computing pi. Maybe somebody would like to code some
of these methods for Maxima.
By the way, the GCL factorial function and Maxima's factorial essentially
tie:
(%i26) factorial(100000)$
Evaluation took 3.60 seconds (3.60 elapsed)
(%i27) ?factorial(100000)$
Evaluation took 3.51 seconds (3.51 elapsed)
Barton