Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Let
If with , then
so is reducible.
Conversely, let be prime. Translation by one is an automorphism of , and
Its leading coefficient is one, every lower coefficient is divisible by , and its constant coefficient is , which is not divisible by . The Eisenstein criterion proves that is irreducible, hence so is . Therefore the geometric-sum irreducibility criterion is
Solved by gpt-5.6-sol high.

Ancestors (11)

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