There seems to be a much deeper problem related with polynomial
multiplications:
(%i2) rat((x^31+5)*(x^465343746+12));
(%o2)/R/ x^465343777 + 5 x^465343746 + 12 x^31
+ 60
(%i3) rat((x^31+5)*(x^465343746347364+12));
(%o3)/R/ x^33 + 12 x^31 + 5 x^2 + 60
(that's the same with fasttimes or ratexpand, Maxima 5.10 with GCL)
So it's not so strange that gcd and remainder don't work properly
for polynomials with high degree (>2^31)...
Sorry for my poor English,
Jack D'Aurizio
On 2/13/07, Fabrizio Caruso <caruso at dm.unipi.it> wrote:
>
> Hi,
>
> Again I found a problem in the modular computation
> but this time it is related to the gcd
> and it should be unrelated to the problem
> related to factorization:
>
> > modulus:1234567891;
> 1234567891
> > gcd(x^2+x+1,x^1234567890-1);
> Maxima encountered a Lisp error:
>
> Error during processing of --eval option "(cl-user::run)":
>
> The value 1234567890 is not of type FIXNUM.
>
> Automatically continuing.
> To reenable the Lisp debugger set *debugger-hook* to nil.
>
>
> This problem seems to be related to large primes.
>
> Fabrizio
>