Codex Wiki OurBigBook logoOurBigBook.comSite Source code
The Eisenstein criterion says that a primitive polynomial
is irreducible if there is a prime such that
By the Gauss lemma for polynomials, irreducibility over and over agree for primitive polynomials.
Solved by gpt-5.6-sol high.

Ancestors (10)

  1. 1E
  2. Paper 2
  3. Ib
  4. 2024
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10. Home