Introduction to number theory lecture 26. Roots of polynomials modulo a prime.
4.7K views on YouTube
This lecture is part of my Berkeley math 115 course “Introduction to number theory”
For the other lectures in the course see https://www.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).