is there a good way of testing if a polynomial f(x,y) is irreducible or not as there is a lack of a is_irreducible command also is there a way for sage not to print the line ? not implemented after checking randomly generated f fits various criterion
-- 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
