On Oct 28, 4:20 am, luisfe <lftab...@yahoo.es> wrote: > Computing with generic quotient rings I am afraid that will be slow > and that will yield to various errors. Specially as in this case, > where the ideal is not prime (you are looking for solutions in GF(4)).
Doesn't GF(4) construct a field with 4 elements? It shouldn't be Z/ 4Z. You can overcome this problem by choosing an irreducible polynomial of degree 2 modulo 2. I'm thinking x^2+x+1 :) Add it to the set of polynomials and compute modulo 2, and you have your own representation of the field. -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
