Source: wikibot/primitive-root-modulo-n
= Primitive root modulo n
{wiki=Primitive_root_modulo_n}
A primitive root modulo \\( n \\) is an integer \\( g \\) such that its powers generate all the integers coprime to \\( n \\) up to \\( n \\).
= Primitive root modulo n
{wiki=Primitive_root_modulo_n}
A primitive root modulo \\( n \\) is an integer \\( g \\) such that its powers generate all the integers coprime to \\( n \\) up to \\( n \\).