Subject: gcd problem / really bignums for exponents
From: Robert Dodier
Date: Wed, 14 Feb 2007 08:26:07 -0700
On 2/14/07, Richard Fateman <fateman at cs.berkeley.edu> wrote:
> OK, here's the choice. Making factorization (and other computations using
> canonical polynomials) n% slower, or when some exponent larger than about
> 2^29 occurs, giving a warning: please reformulate the problem so that such
> large exponents do not occur.
Arguments to f+ are not necessarily exponents. Intermediate results
can overflow a fixnum even if the exponents in question do not.
There may be no exponents in sight anyway (i.e. f+ applied to some
problem not involving polynomials).
Robert