math.wiki
Abstract algebra › Rings in depth › Irreducible polynomials and Eisenstein's criterion
Sign in

Irreducible polynomials and Eisenstein's criterion

A polynomial with rational coefficients could have a factor with any rational coefficients at all. How can one prove that it has none, without an endless search?

Where you are 4 in Rings in depth

Why this exists

For a field F and a nonconstant f \in F[x], the ring F[x]/\langle f \rangle is a field exactly when f is irreducible (Prime and maximal ideals, Theorem 7), and every extension in Field extensions and degree starts from such an f. Over \mathbb{Q} a factor could have any rational coefficients, so irreducibility is not a finite search on its face. This lesson gives the tools that make it one or skip it: roots for degrees 2 and 3, Gauss’s lemma to pass to \mathbb{Z}, reduction modulo a prime, and Eisenstein’s criterion.

Definition

Let F be a field. A polynomial f \in F[x] is irreducible over F if \deg f \ge 1 and f is not a product gh of two polynomials g, h \in F[x] that both have degree at least 1. A polynomial of degree at least 1 that is not irreducible is reducible over F. As the units of F[x] are the nonzero constants (Polynomial rings and the division algorithm, Theorem 2), f is irreducible over F exactly when it is an irreducible element of the ring F[x] (Euclidean domains and principal ideal domains). The field matters: x^2 - 3 is irreducible over \mathbb{Q} and equals \displaystyle (x - \sqrt3)(x + \sqrt3) over \mathbb{R}.

For a prime p, reduction modulo p is the map \pi_p : \mathbb{Z}[x] \to \mathbb{Z}_p[x] that replaces each coefficient a_k by its class [a_k]. More generally, for a prime element p of an integral domain D, \pi_p : D[x] \to (D/\langle p \rangle)[x] reduces every coefficient modulo \langle p \rangle. Either way \pi_p is a ring homomorphism, as shown in the proof of Gauss’s lemma (Unique factorization domains, Theorem 7).

Let D be an integral domain and p \in D a prime element. A polynomial f = a_n x^n + \dots + a_1 x + a_0 \in D[x] with n \ge 1 is Eisenstein at p if p \mid a_k for 0 \le k \le n - 1, p \nmid a_n and p^2 \nmid a_0.

For a prime p, the cyclotomic polynomial is \Phi_p(x) = x^{p - 1} + x^{p - 2} + \dots + x + 1.

Intuition

A factor of degree 1 is a root, and a polynomial of degree 2 or 3 that factors at all has a factor of degree 1. From degree 4 on, roots are not enough.

Gauss’s lemma rescales a factorization over \mathbb{Q} into one over \mathbb{Z}, and reduction modulo p, a homomorphism, carries it into \mathbb{Z}_p[x], where each degree has finitely many polynomials. So if the reduction keeps its degree and does not factor, neither does f. The converse fails, even at every prime at once (Example 7).

Eisenstein’s criterion is reduction pushed to the limit: modulo p, f becomes \pi_p(a_n) x^n, so a factorization f = gh would reduce to (b x^k)(c x^{n - k}), both constant terms would be divisible by p, and a_0, their product, by p^2.

0 1 2 3 4 5 1 2
k
e_k
−35 25 −10 15 7
Figure 1For f = 7x^5 + 15x^4 - 10x^2 + 25x - 35 and p = 5, a dot at (k, e_k), where 5^{e_k} is the largest power of 5 dividing a_k (a_3 = 0 is left off). Eisenstein’s criterion asks for every dot but the last at height at least 1, the first at height exactly 1 and the last at height 0 (Example 4).

Results

Theorem 1 (degrees 2 and 3). Let F be a field and f \in F[x] of degree 2 or 3. Then f is irreducible over F if and only if f has no root in F.

Theorem 2 (from \mathbb{Q} to \mathbb{Z}). Let f \in \mathbb{Z}[x] have degree n \ge 1. (a) If f = GH with G, H \in \mathbb{Q}[x], then f = gh with g, h \in \mathbb{Z}[x] of the same degrees as G and H. (b) If f is primitive (its coefficients have greatest common divisor 1), then f is irreducible in \mathbb{Z}[x] if and only if it is irreducible over \mathbb{Q}. Both hold with \mathbb{Z} replaced by a unique factorization domain D and \mathbb{Q} by \operatorname{Frac}(D).

Theorem 3 (reduction modulo a prime). Let f \in \mathbb{Z}[x] have degree n \ge 1 and leading coefficient a_n, and let p be a prime with p \nmid a_n. Write \pi_p(f) = u\,q_1 q_2 \cdots q_r with u \in \mathbb{Z}_p nonzero and each q_i monic and irreducible over \mathbb{Z}_p (repeats allowed).

  • (a) If f = gh with g, h \in \mathbb{Z}[x], then \pi_p(f) = \pi_p(g)\pi_p(h) with \deg \pi_p(g) = \deg g and \deg \pi_p(h) = \deg h.
  • (b) If f has a factor of degree k over \mathbb{Q}, with 1 \le k \le n - 1, then k = \sum_{i \in S} \deg q_i for some set S \subseteq \{1, \dots, r\}.
  • (c) In particular, if \pi_p(f) is irreducible over \mathbb{Z}_p, then f is irreducible over \mathbb{Q}.

Theorem 4 (Eisenstein’s criterion). Let D be an integral domain, p \in D a prime element, and f \in D[x] Eisenstein at p. Then f is not a product of two polynomials in D[x] of degree at least 1. If D is a unique factorization domain, then f is irreducible over \operatorname{Frac}(D), and if f is also primitive, it is irreducible in D[x]. In particular a polynomial in \mathbb{Z}[x] that is Eisenstein at some prime is irreducible over \mathbb{Q}.

Lemma 5 (shifting). Let F be a field and c \in F. The map \theta_c : F[x] \to F[x], \theta_c(f) = f(x + c), is a ring isomorphism with inverse \theta_{-c}, and \deg \theta_c(f) = \deg f. So f is irreducible over F if and only if f(x + c) is.

Theorem 6. For every prime p, \Phi_p(x) is irreducible over \mathbb{Q}.

Corollary 7. For every positive integer n and prime p, x^n - p is irreducible over \mathbb{Q}. So \mathbb{Q}[x] has irreducible polynomials of every degree, and \displaystyle \sqrt[n]{p} is irrational for n \ge 2.

Why it is true

Proof of Theorem 1. If f = gh with both degrees at least 1, the degrees add to 2 or 3 (Polynomial rings and the division algorithm, Theorem 2), so one factor is ux + v with u \ne 0. Evaluation is a homomorphism (there, Theorem 4), so f(-v/u) = 0. Conversely, a root a gives f = (x - a)q (there, Corollary 5) with \deg q = \deg f - 1 \ge 1. \square

Proof of Theorem 2. This is Theorem 9 of Unique factorization domains, proved there for every unique factorization domain D. \square

Proof of Theorem 3. (a) \pi_p is a ring homomorphism, so \pi_p(f) = \pi_p(g)\pi_p(h). The leading coefficients b of g and c of h satisfy bc = a_n (Polynomial rings and the division algorithm, Theorem 2), and p \nmid a_n, so p \nmid b and p \nmid c: reduction keeps both leading terms.

(b) By Theorem 2, f = gh in \mathbb{Z}[x] with \deg g = k, and by (a), \pi_p(g) has degree k. Write \pi_p(g) and \pi_p(h) as nonzero constants times monic irreducibles of \mathbb{Z}_p[x]. Together these factor \pi_p(f). As \mathbb{Z}_p[x] is a unique factorization domain (Unique factorization domains, Corollary 5) and two monic associates are equal, the monic irreducibles are q_1, \dots, q_r in some order, and those coming from \pi_p(g) have degrees adding to k.

(c) If \pi_p(f) is irreducible, then r = 1 and \deg q_1 = n, and no subset of \{n\} has sum k with 1 \le k \le n - 1. \square

Proof of Theorem 4. Suppose f = gh with g = \sum_i b_i x^i of degree k \ge 1 and h = \sum_j c_j x^j of degree m = n - k \ge 1. As p is prime and divides a_0 = b_0 c_0, it divides b_0 or c_0, and not both, since p^2 \nmid a_0. Say p \mid b_0 and p \nmid c_0. As b_k c_m = a_n and p \nmid a_n, p \nmid b_k. Let r be the least index with p \nmid b_r, so 1 \le r \le k \le n - 1. With c_j = 0 for j > m,

a_r = b_r c_0 + b_{r - 1} c_1 + \dots + b_0 c_r.

Every term after the first contains some b_i with i < r, so is divisible by p, while p \nmid b_r c_0 because p is prime. So p \nmid a_r, against r \le n - 1.

If D is a unique factorization domain, a factorization of f over \operatorname{Frac}(D) into polynomials of degree at least 1 would give one in D[x] with the same degrees (Theorem 2(a)), which was just ruled out; and for primitive f, Theorem 2(b) gives irreducibility in D[x]. \square

Proof of Lemma 5. \theta_c is evaluation at x + c, a ring homomorphism (Polynomial rings and the division algorithm, Theorem 4, with S = F[x]). The homomorphism \theta_{-c} \circ \theta_c fixes constants and sends x to (x - c) + c = x, so it fixes every \sum a_k x^k; likewise \theta_c \circ \theta_{-c}. As (x + c)^k is monic of degree k, \theta_c keeps the leading term a_n x^n. So \theta_c and \theta_{-c} carry factorizations into factorizations with the same degrees. \square

Proof of Theorem 6. Multiplying out, (x - 1)\Phi_p(x) = x^p - 1. Apply \theta_1:

\begin{aligned} x\,\Phi_p(x + 1) &= (x + 1)^p - 1 \\ &= \sum_{k = 1}^{p} \binom{p}{k} x^k, \end{aligned}

by the binomial theorem. Cancelling x in the domain \mathbb{Q}[x],

\begin{aligned} \Phi_p(x + 1) &= x^{p - 1} + \binom{p}{p - 1} x^{p - 2} + \dots \\ &\quad + \binom{p}{2} x + p. \end{aligned}

For 1 \le k \le p - 1, p divides p! = \binom{p}{k}\,k!\,(p - k)! but not k!\,(p - k)!, a product of integers below p; as p is prime, p \mid \binom{p}{k}. The constant term p is not divisible by p^2, so \Phi_p(x + 1) is Eisenstein at p, irreducible by Theorem 4, and \Phi_p is irreducible by Lemma 5. \square

Proof of Corollary 7. x^n - p is Eisenstein at p. For n \ge 2, a rational \displaystyle \sqrt[n]{p} would give a factor \displaystyle x - \sqrt[n]{p} of degree 1 (The remainder and factor theorems). \square

Worked examples

Example 1

Two quartics over \mathbb{Z}_2

Decide whether x^4 + x + 1 and x^4 + x^2 + 1 are irreducible over \mathbb{Z}_2.

Solution

Neither has a root: each has value 1 at 0, and 1 + 1 + 1 = 1 at 1. A quartic factors with degrees 1 + 3, which needs a root, or 2 + 2; so a rootless quartic is reducible only as a product of two rootless quadratics. Of the monic quadratics x^2, x^2 + 1 = (x + 1)^2, x^2 + x and x^2 + x + 1, only the last has no root. The only nonzero constant is 1, so the only reducible rootless quartic is

\begin{aligned} (x^2 + x + 1)^2 &= x^4 + 2x^3 + 3x^2 + 2x + 1 \\ &= x^4 + x^2 + 1. \end{aligned}

So x^4 + x^2 + 1 is reducible although it has no root, and x^4 + x + 1 is irreducible.

Example 2

Reduction modulo 2

Prove that f = 3x^4 + 8x^3 - 6x^2 + 5x - 9 is irreducible over \mathbb{Q} and in \mathbb{Z}[x].

Solution

The leading coefficient 3 is odd, so Theorem 3 applies with p = 2. Reducing 3, 8, -6, 5, -9 modulo 2 gives 1, 0, 0, 1, 1, so \pi_2(f) = x^4 + x + 1, irreducible over \mathbb{Z}_2 by Example 1. By Theorem 3(c), f is irreducible over \mathbb{Q}. As \gcd(3, 8) = 1, f is primitive, hence irreducible in \mathbb{Z}[x] (Theorem 2(b)).

The prime 3 is not allowed, as it divides the leading coefficient: \pi_3(f) = 2x^3 + 2x has dropped to degree 3, and its factorization 2x(x^2 + 1) says nothing about f.

Example 3

Two primes together

Let f = x^4 - x^2 + 2x + 3. Show that \pi_2(f) and \pi_3(f) are both reducible, and that f is irreducible over \mathbb{Q}.

Solution

By Example 1, \pi_2(f) = x^4 + x^2 + 1 = (x^2 + x + 1)^2. Modulo 3,

\pi_3(f) = x^4 + 2x^2 + 2x = x(x^3 + 2x + 2),

and the cubic takes the value 2 at each of 0, 1, 2 (the values 2, 5, 14 reduce to 2), so it is irreducible over \mathbb{Z}_3 by Theorem 1. As f is monic, Theorem 3 applies at both primes. Suppose f had a factor of degree k over \mathbb{Q}, 1 \le k \le 3. By Theorem 3(b) at p = 2, k is a sum of some of the degrees 2, 2, so k = 2; at p = 3, k is a sum of some of 1, 3, so k \in \{1, 3\}. No k does both, so f is irreducible, though neither prime alone settles it.

Example 4

Eisenstein’s criterion

Show that f = 7x^5 + 15x^4 - 10x^2 + 25x - 35 is irreducible over \mathbb{Q} and in \mathbb{Z}[x].

Solution

Take p = 5. It divides 15, 0 (the coefficient of x^3), -10, 25 and -35; it does not divide the leading coefficient 7; and 25 \nmid -35 = -5 \cdot 7. So f is Eisenstein at 5 and irreducible over \mathbb{Q} by Theorem 4. As \gcd(7, 15) = 1, f is primitive and irreducible in \mathbb{Z}[x]. The only other prime dividing -35 is 7, which divides the leading coefficient, so 5 is the only prime that works.

Example 5

A shift first

Prove that f = x^4 - x^3 - 3x^2 + 11x - 5 is irreducible over \mathbb{Q}.

Solution

A prime at which f is Eisenstein divides -5, so it is 5, but 5 \nmid -1, the coefficient of x^3. Shift by 1. Expanding each power of x + 1 by the binomial theorem and collecting,

\begin{aligned} f(x + 1) &= (x^4 + 4x^3 + 6x^2 + 4x + 1) \\ &\quad - (x^3 + 3x^2 + 3x + 1) \\ &\quad - 3(x^2 + 2x + 1) + 11(x + 1) - 5 \\ &= x^4 + 3x^3 + 6x + 3. \end{aligned}

This is Eisenstein at 3: 3 divides 3, 0, 6 and 3, does not divide 1, and 9 \nmid 3. So f(x + 1) is irreducible (Theorem 4), and so is f (Lemma 5). Modulo 3 the shift explains itself: \pi_3(f(x + 1)) = x^4, so \pi_3(f) = (x - 1)^4.

Example 6

A family over F(t)

Let F be a field and n a positive integer. Prove that x^n - t is irreducible over the field F(t) of rational functions, and irreducible in F[t, x].

Solution

Proof. Let D = F[t], a unique factorization domain (Unique factorization domains, Corollary 5) with \operatorname{Frac}(D) = F(t). The element t has degree 1, so it is not a product of two nonconstants, and the constants are units: t is irreducible, hence prime (there, Theorem 2). As a polynomial in x over D, x^n - t has leading coefficient 1, which t does not divide, and every other coefficient is 0 or -t, which t divides; t^2 \nmid -t by degree. So x^n - t is Eisenstein at t, irreducible over F(t) by Theorem 4, and, being monic and so primitive, irreducible in D[x] = F[t, x]. \square For F = \mathbb{Z}_p and n = p, the irreducible x^p - t has formal derivative p x^{p - 1} = 0; this is the kind of polynomial that Field automorphisms and the Galois group sets aside.

Example 7

No prime sees it

Prove that f = x^4 - 14x^2 + 9 is irreducible over \mathbb{Q}, yet \pi_p(f) is reducible for every prime p.

Solution

Proof. By Theorem 2 a factorization over \mathbb{Q} gives one in \mathbb{Z}[x] whose leading coefficients multiply to 1; changing both signs if needed, both factors are monic. A factor of degree 1 is x - a with a \mid 9 (The rational root theorem), but f(\pm 1) = -4, f(\pm 3) = -36 and f(\pm 9) = 5436. Two quadratic factors (x^2 + ax + b)(x^2 + cx + d) need, comparing coefficients,

\begin{aligned} a + c &= 0, \quad a(d - b) = 0, \\ b + d - a^2 &= -14, \quad bd = 9. \end{aligned}

If a = 0, then b + d = -14 and bd = 9, so b, d are roots of y^2 + 14y + 9, whose discriminant 160 is not a square. If d = b, then b = \pm 3 and a^2 = 2b + 14 is 20 or 8, not a square. So f is irreducible.

In \mathbb{Z}[x], as expanding shows,

\begin{aligned} f &= (x^2 - 3)^2 - 8x^2 \\ &= (x^2 + 3)^2 - 20x^2 \\ &= (x^2 - 7)^2 - 40. \end{aligned}

If 2 = b^2 in \mathbb{Z}_p, the first form is a difference of squares: f = (x^2 - 2bx - 3)(x^2 + 2bx - 3). If 5 = c^2, then f = (x^2 - 2cx + 3)(x^2 + 2cx + 3), and if 10 = d^2, then f = (x^2 - 7 - 2d)(x^2 - 7 + 2d). So it is enough that one of 2, 5, 10 is a square in \mathbb{Z}_p. For p = 2 and p = 5, 0 = 0^2 is one of them. For any other p, squaring a \mapsto a^2 is a homomorphism of the abelian group \mathbb{Z}_p^\times whose kernel is the roots of x^2 - 1, namely \pm 1, two elements as p is odd (Polynomial rings and the division algorithm, Theorem 6). Each value is taken on a coset of the kernel, so the group S of squares has \displaystyle \frac{p - 1}{2} elements and \mathbb{Z}_p^\times / S has order 2 (Quotient groups). If 2 and 5 are not squares, both lie in the coset other than S, so 10S = (2S)(5S) = S: 10 is a square. \square

Boundaries

  • Reduction needs p \nmid a_n and goes one way. 2x^2 + 3x + 1 = (2x + 1)(x + 1), yet \pi_2 of it is x + 1, irreducible: the degree dropped. And x^4 - 14x^2 + 9 is irreducible with every reduction reducible (Example 7).
  • Each hypothesis of Eisenstein’s criterion is needed. x^2 - 4 = (x - 2)(x + 2) fails only p^2 \nmid a_0. Over \mathbb{Z} the criterion gives irreducibility in \mathbb{Z}[x] only for primitive f: 3x^2 + 6 is Eisenstein at 2, irreducible over \mathbb{Q}, and equal to 3(x^2 + 2), a product of nonunits of \mathbb{Z}[x].
  • Sufficient, not necessary. x^2 + 1 is irreducible over \mathbb{Q} but Eisenstein at no prime; its shift x^2 + 2x + 2 is Eisenstein at 2.

Where this goes next

An irreducible f \in F[x] of degree n gives a field F[x]/\langle f \rangle of degree n over F (Field extensions and degree). Algebraic elements and minimal polynomials uses these tests to recognize minimal polynomials, such as x^n - p for \displaystyle \sqrt[n]{p}, and Finite fields counts the monic irreducibles over \mathbb{Z}_p of each degree.

Exercises

Small fields

  1. List the monic irreducible quadratics over \mathbb{Z}_3.
  2. Over \mathbb{Z}_5, decide whether x^3 + 3x + 2 and x^3 + x + 3 are irreducible, and factor the reducible one into irreducibles.
  3. Over \mathbb{Z}_2, show that x^5 + x^2 + 1 is irreducible, and factor x^5 + x^4 + 1 into irreducibles.

Over \mathbb{Q}

  1. Use Exercise 3 to prove that 3x^5 - 4x^4 + 7x^2 + 10x - 5 is irreducible over \mathbb{Q}.
  2. Decide whether x^3 - 7x + 5 is irreducible over \mathbb{Q}.
  3. Show that x^4 + 3x^2 + 4 has no rational root, and factor it into two quadratics in \mathbb{Z}[x].
  4. For a cryptogram, Aisha hides a monic quartic f \in \mathbb{Z}[x] and publishes two clues: \pi_2(f) = x(x^3 + x + 1) and \pi_3(f) = (x^2 + 1)(x^2 + x + 2). Malik says the clues alone prove f irreducible over \mathbb{Q}. Is he right? Find the one f that fits the clues and has every coefficient between -2 and 3.

Eisenstein and shifts

  1. For each polynomial, find every prime at which it is Eisenstein, and decide whether it is irreducible over \mathbb{Q}: (a) 3x^5 - 14x^2 + 21x - 7; (b) x^6 + 6x + 12; (c) x^4 + 10x^3 + 35x^2 + 50x + 25.
  2. Show that f = x^3 + 3x^2 + 5x + 5 is Eisenstein at no prime, and find c \in \mathbb{Z} with f(x + c) Eisenstein.
  3. Show that x^3 + t^2 x + t is irreducible over \mathbb{Q}(t).
  4. Write out \Phi_7(x + 1) and check the hypotheses of Eisenstein’s criterion at 7.

Proofs

  1. Let F be a field and f \in F[x] of degree n \ge 2. Prove that f is irreducible over F if and only if it has no factor of degree k with 1 \le k \le n/2.
  2. Let f = a_n x^n + \dots + a_0 \in \mathbb{Z}[x] with n \ge 1 and a_0 \ne 0, and let f^*(x) = a_0 x^n + a_1 x^{n - 1} + \dots + a_n. Prove that f is irreducible over \mathbb{Q} if and only if f^* is. Deduce that if a prime p satisfies p \nmid a_0, p \mid a_k for 1 \le k \le n and p^2 \nmid a_n, then f is irreducible over \mathbb{Q}.
  3. Let p be prime. Prove that \Phi_p(x^p) is irreducible over \mathbb{Q}.
  4. Let a_1, \dots, a_n be distinct integers. Prove that (x - a_1)\cdots(x - a_n) - 1 is irreducible over \mathbb{Q}.
  5. Prove that every field has infinitely many monic irreducible polynomials, and deduce that over a finite field there are irreducible polynomials of arbitrarily large degree.
Answers
  1. x^2 + 1, x^2 + x + 2, x^2 + 2x + 2: of the 9 monic quadratics, the other six are the products (x - a)(x - b), and these three have no root (Theorem 1).
  2. x^3 + 3x + 2 takes the values 2, 1, 1, 3, 3 at 0, 1, 2, 3, 4, so it is irreducible (Theorem 1). x^3 + x + 3 has the root 1, and x^3 + x + 3 = (x - 1)(x^2 + x + 2); the quadratic has values 2, 4, 3, 4, 2, so it is irreducible.
  3. A factorization of a quintic has a factor of degree 1 or 2; by Example 1 the only irreducible quadratic is x^2 + x + 1, which divides x^3 - 1, so x^3 \equiv 1 modulo it. Then x^5 + x^2 + 1 \equiv x^2 + x^2 + 1 = 1, and neither quintic has a root (value 1 at 0 and 1): x^5 + x^2 + 1 is irreducible. But x^5 + x^4 + 1 \equiv x^2 + x + 1 \equiv 0, and x^5 + x^4 + 1 = (x^2 + x + 1)(x^3 + x + 1), the cubic having no root.
  4. The leading coefficient 3 is odd, and reducing modulo 2 gives x^5 + x^2 + 1, irreducible by Exercise 3; Theorem 3(c) applies.
  5. Irreducible. A rational root would be \pm 1 or \pm 5, where the values are -1, 11, 95, -85; Theorem 1 applies.
  6. Every term is at least 0 and the constant is 4, so there is no real root. And x^4 + 3x^2 + 4 = (x^2 + 2)^2 - x^2, which is (x^2 + x + 2)(x^2 - x + 2).
  7. Yes. As f is monic, Theorem 3(b) applies: degrees 1, 3 modulo 2 allow a factor of degree 1 or 3 only, and degrees 2, 2 modulo 3 allow degree 2 only. The clues expand to x^4 + x^2 + x and x^4 + x^3 + x + 2, fixing each coefficient modulo 6, and -2, \dots, 3 is a full set of residues: f = x^4 - 2x^3 + 3x^2 + x + 2.
  8. (a) Only 7 divides -7, and 7 divides -14, 21, -7 and the zero coefficients, not 3, and 49 \nmid 7: Eisenstein at 7 only, irreducible. (b) The primes dividing 12 are 2 and 3; 4 \mid 12 rules out 2, and 3 divides 6 and 12 with 9 \nmid 12: Eisenstein at 3 only, irreducible. (c) Only 5 divides 25, and 25 \mid 25: Eisenstein at no prime. It is reducible: (x^2 + 5x + 5)^2.
  9. A prime dividing 5 is 5, which does not divide 3. With c = -1, f(x - 1) = x^3 + 2x + 2, Eisenstein at 2.
  10. Over D = \mathbb{Q}[t] with the prime t: t divides 0, t^2 and t, not the leading 1, and t^2 \nmid t. Theorem 4 gives irreducibility over \mathbb{Q}(t).
  11. The coefficients of \Phi_7(x + 1), from x^6 down, are \binom{7}{k} for k = 7, 6, \dots, 1: 1, 7, 21, 35, 35, 21, 7. 7 divides each one after the first, not 1, and 49 \nmid 7.
  12. Proof. If f = gh with \deg g, \deg h \ge 1, the degrees add to n, so the smaller one is at most n/2. Conversely, a factor g with 1 \le \deg g \le n/2 < n gives f = gh with \deg h = n - \deg g \ge 1. \square
  13. Proof. f^*(x) = x^n f(1/x), of degree n as a_0 \ne 0. If f = gh with \deg g = k and \deg h = n - k both at least 1, then f^* = g^* h^* with g^* = x^k g(1/x) and h^* = x^{n - k} h(1/x), whose leading coefficients g(0) and h(0) are nonzero as g(0)h(0) = a_0: so f^* is reducible. As a_n \ne 0, (f^*)^* = f, which gives the converse. Under the stated conditions f^* is Eisenstein at p, so irreducible (Theorem 4), and so is f. \square
  14. Proof. Let g = \Phi_p(x^p), monic of degree p(p - 1), with (x^p - 1)g = x^{p^2} - 1, and h(x) = g(x + 1), so \bigl((x + 1)^p - 1\bigr)h = (x + 1)^{p^2} - 1. In \mathbb{Z}_p[x], (x + 1)^p = x^p + 1, since p \mid \binom{p}{k} for 0 < k < p (proof of Theorem 6). The same expansion with x^p in place of x gives (x + 1)^{p^2} = (x^p + 1)^p = x^{p^2} + 1. So x^p \pi_p(h) = x^{p^2}, and cancelling in the domain \mathbb{Z}_p[x], \pi_p(h) = x^{p^2 - p}: every non-leading coefficient of h is divisible by p. Its constant term is h(0) = g(1) = \Phi_p(1) = p, not divisible by p^2. So h is Eisenstein at p, and g is irreducible by Theorem 4 and Lemma 5. \square
  15. Proof. Call the polynomial f, of degree n. If f were reducible, Theorem 2 would give f = gh in \mathbb{Z}[x] with both degrees between 1 and n - 1 and leading coefficients multiplying to 1; changing both signs if needed, g and h are monic. For each i, g(a_i)h(a_i) = f(a_i) = -1 with integer factors, so g(a_i) = -h(a_i). Then g + h has degree at most n - 1 and n distinct roots, so g + h = 0 (Polynomial rings and the division algorithm, Theorem 6), and h = -g has leading coefficient -1, not 1. \square
  16. Proof. x is monic and irreducible. If q_1, \dots, q_m were all the monic irreducibles, g = q_1 \cdots q_m + 1, of degree at least 1, would have some q_i as a factor (F[x] is a unique factorization domain), and q_i \mid 1, impossible. If F is finite, each degree has finitely many monic polynomials, so the degrees are unbounded. \square
math.wiki · updated 2026-11-18 · CC-BY-SA-4.0