Well they are not all distinct. Obviously there are at most possible values.
It may happen that are all distinct. In this case we say is a primitive root mod . Generally though is not a primitive root.
Can someone kindly explain to me why in the sequence, they are all distinct?
a mod p, a^2 mod p, a^3 mod ... are all distinct?
If so, how do we know which element in the afrmentioned sequence is equal to the element in the sequence below:
1 mod p, 2 mod p, ..., (p-1) mod p.