Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

How sage checks the irreducibility of a polynomial?

Hi, given a polynomial we can check whether its irreducibility via .is_irreducible() command. I wonder how sage checks it so fast even though the polynomial has large degree with large coefficients?