Let be the ring of polynomials in the variable with rational coefficients and the ring of polynomials in the variable with integer coefficients.
Let .
In which ring(s) of polynomials is irreducible? (irreducible basically means, you can't factor it into a product of lower degree polynomials. More details below.)
NB: Some terminology which may be helpful:
A set equipped with the abstract operations is a ring if the following criteria are satisfied:
a. is an additive abelian group.
b.
c. such that
Example. under is a ring.
Let be a ring. is a unit of if there exists such that .
Example. is a unit in , also in , but not in .
Let be a ring. is a zero divisor if there exists nonzero such that .
Example. In , and are nonzero zero divisors. In any ring, is always a zero divisor. In , there are no nonzero zero divisors.
Let be an integral domain (that is, there are no nonzero zero divisors in ). We say that a nonzero, non-unit polynomial in the polynomial ring over the ring is irreducible if such that , either is a unit in or is a unit in .
Example. Any linear polynomial (degree 1) is irreducible.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First, we note that x f ( x ) = ( x + 1 ) 2 0 2 7 − 1 = k = 1 ∑ 2 0 2 7 ( 2 0 2 7 2 0 2 7 − k ) x k . 2 0 2 7 is prime, divides all coefficients except that of x 2 0 2 6 , but 2 0 2 7 2 does not divide 2 0 2 7 ; hence, f ( x ) is 2 0 2 7 -Eisenstein. By the Eisenstein criterion, f ( x ) is is irreducible in Q [ x ] . Since the greatest common divisor of all the coefficients is 1 , a unit in Z [ x ] , f ( x ) is primitive. By Gauss's Lemma, combined with irreducibility of f ( x ) in Q [ x ] , f ( x ) is also irreducible in Z [ x ] . □