Finding Primitive Roots of a Number in Number Theory and Cryptography

In modular arithmetic, a number g is a primitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. That is, g is a primitive root modulo n if for every integer a coprime to n, there is some integer k for which gk ≡ a (mod n). Such a value k is called the index or discrete logarithm of a to the base g modulo n. So g is a primitive root modulo n if and only if g is a generator of the multiplicative group of integers modulo n. DON’T FORGET TO LIKE & SUBSCRIBE TO THE CHANNEL & CLICK THE BELL ICON FOR LATEST UPDATES. YOUTUBE CHANNEL LINK : https://www.youtube.com/@Muhammed_Mustaqim