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 \).