On Sep 30, 7:07 pm, Zimmermann Paul <paul.zimmerm...@loria.fr> wrote: > John, > > > I can easily factor mod two primes around 10^7 and then use CRT, > > though that is a bit of a pain. So my question is: what's this limit > > on the size of primes p for which factorization over GF(p)[X,Y] is > > possible, where does this limit come from, and is it documented? > > the limit is p < 2^29 for factorization over GF(p)[X,Y]. > Seehttp://trac.sagemath.org/sage_trac/ticket/11829. > Note however that Singular is broken for such > computations:http://trac.sagemath.org/sage_trac/ticket/10902. >
Thanks. I was puzzled by noticing that for primes just a little too big I got the helpful message (about 2^29) but for next_prime(10^14) it crashed. But that was with 4.7.1. John > Paul -- 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
