Let a,n be positive integers with gcd(a,n)=1. Show that if has a solution, then , where d = gcd ( ).
Note: denotes the number of positive integers less than a that are relative prime to a.
Follow Math Help Forum on Facebook and Google+
I think you forgot to mention the important detail. If has a primitive root ...
I'm reading the problem now and it didn't mention that n has a primitive root, perhaps it is a mistake?
View Tag Cloud