Let n be a positive integer. There exists a primitive root mod n exactly in the following cases and no others:
- n=1, 2, or 4
- n=pr where p is an odd prime
- n=2pr where p is an odd prime
PREVIOUSEuler's Φ Function
Let n be a positive integer. There exists a primitive root mod n exactly in the following cases and no others: