Hi everyone, I would like to know which test Sage uses to test irreducibility of a polynomial over GF(2). Is it Rabin`s Test? How to compute the first condition? I am not asking for the command, just the technique<http://www.dict.cc/englisch-deutsch/technique.html> .
Thanks. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
