Hi all again,
I just want to point out that the 2 problems
I reported seem very unrelated to me.
- The gcd problem is related to some sort
of overflow due perhaps to an
(unreasonable for me in a "symbolic system")
limit of the size of expoennts.
Remark: IMHO from a symbolic system most people expect
arbitrarily long integers.
- The factor problem seems very different:
The example I showed features no big numbers
and the error message is a different one.
Fabrizio
On Tue, 13 Feb 2007, Fabrizio Caruso 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
>
>
>