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

suppose $n\in N$ (Natural numbers) . proof that $gcd(n,phi(n))=1$ if and only if for every $a\in Z$ , there is $b\in N$ that $b^b\equiv a (mod\: n)$