ok just to make sure I get this....lets say p is a prime number....

p= 21169 to determine which g^2,g^3...are primitive roots modulo 21169

g^k is primitive root iff gcd (k,phi(p)) = 1

therefore, k couldn't be a factor of a? is this another way of putting it?