Exercise 1842Number theory › PrimesM1Added 3 Nov 2026
Primes and polynomial irreducibility
#irreducibility#primes#polynomial
Statement
Show that if is prime, then is irreducible over iff is a quadratic non-residue mod .
Hint
A quadratic is reducible iff it has a root, i.e. iff is a square mod .
Show solutionHide solution
Solution
Root condition. has a root in iff is a QR mod .
Irreducibility. A quadratic over a field is irreducible iff it has no root. So is irreducible iff is a QNR mod .
Examples. : is QNR, irreducible. : is QR (), reducible: .
Conclusion. The irreducibility is governed by the Legendre symbol .