infinite loop on gcd() probably just a long time. Workaround exists
Subject: infinite loop on gcd() probably just a long time. Workaround exists
From: laurent couraud
Date: Wed, 11 May 2005 23:54:09 +0200
> De : Richard Fateman [mailto:fateman@cs.berkeley.edu]
> if you do gcd:spmod; then the answer
> returns almost instantly that gcd=1. This uses a different gcd
> program that is more efficient on sparse polynomials.
>
OK. I will try spmod version of gcd.
> also, the fullratsimp is unnecessary, since the gcd() command converts
> its inputs to fully-expanded form.
If its inputs are already factored it expand it also?