Войти
  • 472Просмотров
  • 4 года назадОпубликованоNecessary and Sufficient

Irreducibility of a cyclotomic polynomial of prime degree over the rational numbers

In this video we prove that any cyclotomic polynomial of prime degree is irreducible over the rational numbers. This is a fairly standard exercise, but its proof contains a few tricks definitely worth remembering for solving similar questions. At the end of the video we give an example of an old qualifying exam problem that can be solved using this video as one of the prerequisites.