## You are here

HomeA. Cohn's irreducibility criterion

## Primary tabs

# A. Cohn’s irreducibility criterion

###### Theorem.

Assume $n\geq 2$ is an integer and that $P$ is a polynomial with coefficients in $\{0,1,\ldots,n-1\}$. If $P(n)$ is prime then $P(x)$ is irreducible in $\mathbb{Z}[x]$.

A proof is given in [MRM].

A. Cohn [PZ] proved this theorem for the case $n=10$.

This special case of the above theorem is sketched as problem 128, Part VIII, in [PZ].

# References

- PZ George PÃ³lya, Gabor Szego, Problems and Theorems in Analysis II, Classics in Mathematics 1998.
- MRM M. Ram Murty, Prime Numbers and Irreducible Polynomials, American Mathematical Monthly, vol. 109, (2002), 452-458.

Type of Math Object:

Theorem

Major Section:

Reference

## Mathematics Subject Classification

11C08*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections

## Corrections

title by matte ✓

irreducible is a bad link by matte ✓

n is also degree? by Stig Hemmer ✓

spelling by Mathprof ✓

wording; numbering by mps ✓

irreducible is a bad link by matte ✓

n is also degree? by Stig Hemmer ✓

spelling by Mathprof ✓

wording; numbering by mps ✓