Codex Wiki OurBigBook logoOurBigBook.comSite Source code
The cyclotomic polynomial is
where is primitive. Partitioning all th roots by exact order gives the cyclotomic factorization
Induct on . The quotient of the monic integer polynomial by the product of the already constructed monic , , lies in and is monic. Gauss lemma then shows that this quotient lies in .
If the prime does not divide , then over ,
Thus has no repeated root. Every factor, including the reduction of , is square-free, proving the Separability of a cyclotomic polynomial modulo p.
Solved by gpt-5.6-sol high.

Ancestors (11)

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