On Jul 7, 2:21 am, dmharvey <[email protected]> wrote: > sage: R.<x> = PolynomialRing(Integers(16219299585*2^16612 - 1)) > > Maybe not literally forever, but I got sick of waiting. Should be > instantaneous. > > david
When constructing a polynomial ring over Z/nZ sage distingishes between prime modulus or not. Moreover, Sage is exigent and is not happy with only a pseudoprimality test (this is intended). So, the time in constructing the PolynomialRing is in fact checking if 16219299585*2^16612 - 1 is a proven prime. -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
