Thank you! The patch worked well.
Unfortunately, the computation is very slow with option "sparse". It
takes forever to complete
sage: p = 1073741477
sage: A. = PolynomialRing(Integers(p),sparse=True)
sage: f = T^5 + 13775595*T^4 + 788683423*T^3 + 305120033*T^2 +
585880735*T + 686097596
sage:
Yep, this was a bug. Fix is up here:
http://trac.sagemath.org/sage_trac/ticket/3272
Give it a try, and let me know if you run into any more trouble.
-cc
On Thu, May 22, 2008 at 11:13 AM, Kirill Vankov <[EMAIL PROTECTED]> wrote:
>
> Is there any way to define a polynomial ring over a sparse quo
