IrreduciblePolynomialQ

IrreduciblePolynomialQ[poly]

tests whether poly is an irreducible polynomial over the rationals.

IrreduciblePolynomialQ[poly,Modulusp]

tests whether poly is irreducible modulo a prime p.

IrreduciblePolynomialQ[poly,Extension{a1,a2,}]

tests whether poly is irreducible over the field extension generated by the algebraic numbers ai.

IrreduciblePolynomialQ[poly,ExtensionAll]

tests whether poly is absolutely irreducible over the complex numbers.

Details and Options

Examples

open allclose all

Basic Examples  (1)

Test irreducibility of polynomials:

In[1]:=
Click for copyable input
Out[1]=

Scope  (8)

Options  (5)

Properties & Relations  (2)

Possible Issues  (1)

See Also

Factor  SquareFreeQ  Decompose  PrimeQ  PolynomialQ  PrimitivePolynomialQ

Introduced in 2008
(7.0)