Irreducibility and the Schoenemann-Eisenstein Criterion - Famous Math Problems 20
Offered By: Insights into Mathematics via YouTube
Course Description
Overview
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
Related Courses
Number Theory and CryptographyUniversity of California, San Diego via Coursera More Fun with Prime Numbers
Kyoto University via edX Mathematical Foundations for Cryptography
University of Colorado System via Coursera Mathematics for Computer Science
University of London International Programmes via Coursera Algorithms with Numbers
Saint Petersburg State University via Coursera