Irreducibility of Polynomials
[14/100%]If a polynomial with integral coefficients is reducible, then it is the product of polynomials with integral coefficients of lower degree.
A polynomial with integral coefficients cannot vanish at an integral value of , if and are both odd.
If the polynomial of degree with integral coefficients assumes at distinct integral values of values that are all different from 0 and in absolute value less than
then is irreducible.
Cf. Problem 70 of Part VI.
The bound given in 118 may be replaced by
where is the minimum distance between any two of the integral values of where assumes the integral values considered.
In order that the value of the polynomial with integral coefficients should be equal to a prime number for infinitely many integral values of , must be irreducible and the greatest common divisor of the coefficients of must be 1. The converse of this obvious statement is not true. The polynomial
is irreducible but it does not represent a prime number for any integral value of , if .
Let be distinct integers. Prove that the function
is always irreducible.
(continued). Investigate the cases in which
is reducible.
(continued). The function
is irreducible.
(continued). The function
is also irreducible.
Investigate the reducibility of , where is a positive definite irreducible polynomial with integral coefficients (continuing the study of 121--124). If is a positive definite irreducible polynomial with integral coefficients, then
is reducible only if (the 12th cyclotomic polynomial) and where is an integer.
(continued). If is positive and integral, then
is reducible only if is the fourth power of an integer.
Let be a polynomial with integral coefficients and assume that there exists an integer such that the following three conditions are satisfied:
The zeros of lie in the half-plane .
.
is a prime number.
Then is irreducible.
Let
be a prime number expressed in the decimal system, , ; . Then the polynomial
is irreducible.
Cf. Problem 127, Problem 24 of Part III.
Let and be odd prime numbers, such that
(For definition of the Legendre symbol see Problem 45 of Part V.) Such prime numbers are for example and . The polynomial
is irreducible but it is ``reducible'' (it can be expressed as the product of two factors of the 2nd degree) modulo , where is an arbitrary integer, as can be shown in an elementary manner by formulae (1), (2) and (3).