least common multiple by hand is much faster than maxima implementation
Subject: least common multiple by hand is much faster than maxima implementation
From: andre maute
Date: Mon, 19 Sep 2011 20:53:30 +0200
Hi list,
I have the following attached least common multiple test,
which I canceled after half an hour of computation.
Doing it by hand can be done easily in 2 minutes,
because the terms are factored.
Does somebody have a faster implementation?
Andre
-------------------------------------
[user at home ~]$ maxima -v
+ '[' sbcl = clisp ']'
+ '[' sbcl = cmucl ']'
+ '[' sbcl = scl ']'
+ '[' sbcl = gcl ']'
+ '[' sbcl = acl ']'
+ '[' sbcl = openmcl ']'
+ '[' sbcl = ecl ']'
+ '[' sbcl = sbcl ']'
+ exec sbcl --core
/home/user/opt/maxima/lib/maxima/5.19.2/binary-sbcl/maxima.core
--noinform --end-runtime-options --eval '(cl-user::run)'
--end-toplevel-options -v '' '' '' '' '' '' '' ''
Maxima 5.19.2 http://maxima.sourceforge.net
Using Lisp SBCL 1.0.40-1.fc14
Distributed under the GNU Public License. See the file COPYING.
Dedicated to the memory of William Schelter.
The function bug_report() provides bug reporting information.
-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: lcm-test-1.max
URL: <http://www.math.utexas.edu/pipermail/maxima/attachments/20110919/2d44a67b/attachment.ksh>;