id summary reporter owner description type status priority milestone component version resolution keywords cc
138 Int overflow in integer mod ring Martin Albrecht hannes "{{{
> ring r = (integer,2,32),(x,y,z),dp;
// ** You are using coefficients rings which are not fields.
// ** Please note that only limited functionality is available
// ** for these coefficients.
// **
// ** The following commands are meant to work:
// ** - basic polynomial arithmetic
// ** - std
// ** - reduce
// ** redefining r **
> 2*(2*x^30);
4x30
> 2*(2*x)^30;
-2147483648x30
> 2*(2^30);
// ** int overflow(*), result may be wrong
-2147483648
}}}
So it seems 2^32^ should not be allowed as base ring (since it is too big). This is on sage.math btw. which is a 64-bit Linux." bug closed major 3-1-1 singular-kernel 3-1-0 wontfix