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

Printable View