A primitive root modulo n is an integer a such that every integer relatively prime to n can be written as a power of a modulo n. They have many applications in cryptography and number theory.
A primitive root modulo n is an integer a such that every integer relatively prime to n can be written as a power of a modulo n. They have many applications in cryptography and number theory.