Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Let satisfy . Since ,
The polynomial has degree and has root . It is irreducible exactly when .
If for some , then is a root of of degree at most , so is reducible. Conversely, if it is reducible, then
Since is prime, implies . Applying coprime-degree descent for powers to and shows that is a th power in . Hence
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. C
  2. 18H
  3. Paper 1
  4. Ii
  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