Arthur Cohn's irreducibility criterion is a sufficient condition for a polynomial to be irreducible in ${\displaystyle \mathbb {Z} [x]}$—that is, for it to be unfactorable into the product of lower-degree polynomials with integer coefficients.

The criterion is often stated as follows:

If a prime number ${\displaystyle p}$ is expressed in base 10 as ${\displaystyle p=a_{m}10^{m}+a_{m-1}10^{m-1}+\cdots +a_{1}10+a_{0}}$ (where ${\displaystyle 0\leq a_{i}\leq 9}$) then the polynomial

${\displaystyle f(x)=a_{m}x^{m}+a_{m-1}x^{m-1}+\cdots +a_{1}x+a_{0}}$

is irreducible in ${\displaystyle \mathbb {Z} [x]}$.

The theorem can be generalized to other bases as follows:

Assume that ${\displaystyle b\geq 2}$ is a natural number and ${\displaystyle p(x)=a_{k}x^{k}+a_{k-1}x^{k-1}+\cdots +a_{1}x+a_{0}}$ is a polynomial such that ${\displaystyle 0\leq a_{i}\leq b-1}$. If ${\displaystyle p(b)}$ is a prime number then ${\displaystyle p(x)}$ is irreducible in ${\displaystyle \mathbb {Z} [x]}$.

The base 10 version of the theorem is attributed to Cohn by Pólya and Szegő in one of their books^[1] while the generalization to any base b is due to Brillhart, Filaseta, and Odlyzko.^[2]

In 2002, Ram Murty gave a simplified proof as well as some history of the theorem in a paper that is available online.^[3]

A further generalization of the theorem allowing coefficients larger than digits was given by Filaseta and Gross.^[4] In particular, let ${\displaystyle f(x)}$ be a polynomial with non-negative integer coefficients such that ${\displaystyle f(10)}$ is prime. If all coefficients are ${\displaystyle \leq }$ 49598666989151226098104244512918, then ${\displaystyle f(x)}$ is irreducible over ${\displaystyle \mathbb {Z} [x]}$. Moreover, they proved that this bound is also sharp. In other words, coefficients larger than 49598666989151226098104244512918 do not guarantee irreducibility. The method of Filaseta and Gross was also generalized to provide similar sharp bounds for some other bases by Cole, Dunn, and Filaseta.^[5]

The converse of this criterion is that, if p is an irreducible polynomial with integer coefficients that have greatest common divisor 1, then there exists a base such that the coefficients of p form the representation of a prime number in that base; this is the Bunyakovsky conjecture and its truth or falsity remains an open question.

Historical notes

• Polya and Szegő gave their own generalization but it has many side conditions (on the locations of the roots, for instance) so it lacks the elegance of Brillhart's, Filaseta's, and Odlyzko's generalization.
• It is clear from context that the "A. Cohn" mentioned by Polya and Szegő is Arthur Cohn (1894–1940), a student of Issai Schur who was awarded his doctorate from Frederick William University in 1921.^[6][7]

See also

• Eisenstein's criterion
• Perron's irreducibility criterion

References

External links

• "A. Cohn's irreducibility criterion". PlanetMath.