Introduction to number theory lecture 26. Roots of polynomials modulo a prime. @richarde.borcherds7998
Introduction to number theory lecture 26. Roots of polynomials modulo a prime.  @richarde.borcherds7998
Uploaded March 2022 | Updated November 2026, 2 days ago
This lecture is part of my Berkeley math 115 course "Introduction to number theory"
For the other lectures in the course see youtube.com/playlist?list=PL8yHsr3EFj53L8sMbzIhhXSAOpuZ1Fov8

We sketch the Cantor-Zassenhaus algorithm for finding roots of a polynomial moula a prime.

The textbook is "An introduction to the theory of numbers" by Niven, Zuckerman, and Montgomery (5th edition).
Introduction to number theory lecture 26. Roots of polynomials modulo a prime.Introduction to number theory lecture 51. Proof of Dirichlets theoremComplex analysis: Elliptic functionsIntroduction to number theory lecture 25. Quadratic equations mod p.Galois theory: Norm and traceGalois theory: Abels theoremIntroduction to number theory lecture 17. Factorization.Rings and modules 2: Group ringsRIngs 19 Symmetric functionsCategories 1 IntroductionTheory of numbers: Euclids algorithmComplex analysis: Roots
Richard E Borcherds |

Introduction to number theory lecture 26. Roots of polynomials modulo a prime.

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER