Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

In Sage, how do I check for irreducibility of a polynomial modulo prime.

In particular, I need to check irreducibility of this polynomial, x^8+x^2+1, modulo 3.