4.I.2G
Let be an integer. Show that the polynomial is irreducible over if and only if is prime.
[You may use Eisenstein's criterion without proof.]
Typos? Please submit corrections to this page on GitHub.
4.I.2G
Let be an integer. Show that the polynomial is irreducible over if and only if is prime.
[You may use Eisenstein's criterion without proof.]