Factoring Polynomials over Various Rings

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

This Demonstration looks at the factorization of polynomials over the integers, the Gaussian integers, and the finite fields , where is prime.


Irreducible polynomials are used to generate new fields using the ring of cosets formed by the ideal generated by the irreducible polynomial. Polynomials of degree two or three are irreducible if and only if they have no linear factors and hence no roots. Polynomials of degree four are thus the first interesting case. If there is a prime such that the polynomial is irreducible in the finite field , then is irreducible over the integers.

However, there are irreducible polynomials over the integers that factor over all primes. The Gaussian integers are an alternative number system used to check for factorization.


Contributed by: Theodore S. Erickson (Wheeling Jesuit University) (March 2011)
Based on a program by: Eric W. Weisstein
Open content licensed under CC BY-NC-SA



Snapshot 1: does factor over the Gaussian integers using

Snapshot 2: factors into four linear factors in

Snapshot 3: factors into two quadratic factors in

J. A. Gallian, Contemporary Abstract Algebra, 7th ed., Belmont, CA: Brooks/Cole, 2010.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.