If p is a prime number and b is a primitive root modulo p, and n is a positive integer:
first I had to express the general solution of the congruence eqt. x^n [congruent to] 1 (mod p) in terms of b
...
I found the solutions are:
x= b^i for 1 <= i <= n such that (p-1)/gcd (p-1,i) | n
now I need to find how many incongruent solutions modulo p this congruence equation has...this one seems much tougher, and any help/hint would be appreciated