In number theory, 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. In symbols, 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).
In number theory, 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. In symbols, 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).
Source: Wikipedia "Primitive root modulo n" · CC BY-SA 4.0
Share this article: X · Bluesky