Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Regard
as a monic quadratic in over . By the Gauss lemma for polynomials, reducibility in would imply reducibility in , so would be a square in . This is impossible: its zero at has odd order one, whereas every zero or pole of a square in a rational-function field has even order. Hence
The same odd-valuation obstruction to a rational-function square works over every field of characteristic different from two, since the zeros and are then distinct. It does not work over every field. In characteristic two,
so the polynomial is reducible.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. Ii
  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