On Jul 7, 4:56 am, Simon King <simon.k...@nuigalway.ie> wrote: > Hi! > > On 7 Jul., 09:48, luisfe <lftab...@yahoo.es> wrote: > > > ... > > So, the > > time in constructing the PolynomialRing is in fact checking if > > 16219299585*2^16612 - 1 is a proven prime. > > ... which means that the user should be given the opportunity to > *assert* that the number is prime (or non-prime).
Right, in fact the modulus *is* prime, but that's not easy to prove (for sage or anyone else). For my application, all I want to do is construct an elliptic curve over GF(p) and do some point multiplication in it. david -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
