Irreducibility and the Schoenemann-Eisenstein Criterion - Famous Math Problems 20
Insights into Mathematics via YouTube
Future-Proof Your Career: AI Manager Masterclass
Stuck in Tutorial Hell? Learn Backend Dev the Right Way
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore the concepts of irreducibility and the Schoenemann-Eisenstein criterion in this 30-minute mathematics lecture. Delve into the definition and computation of cyclotomic polynomials, examining Gauss's lemma and its connection between irreducibility over integers and rational numbers. Learn about T. Schoenemann's irreducibility criterion, which utilizes mod p arithmetic for prime p, and its application to cyclotomic polynomials indexed by a prime. Discover how this criterion establishes Eisenstein's criterion, gaining valuable insights into advanced mathematical concepts and their interrelationships.
Syllabus
Irreducibility and the Schoenemann-Eisenstein criterion | Famous Math Probs 20b | N J Wildberger
Taught by
Insights into Mathematics