Thread: how to proof gcd(n,phi(n))=1 if b^b=a (mod n)

suppose (Natural numbers) . proof that if and only if for every , there is that

please help me to proof this .