Prove that if $\displaystyle \phi(n)|(n-1)$ then $\displaystyle n$ is prime, where $\displaystyle \phi(n)$. is the Euler's totient function.
I am able to show that $\displaystyle n$ is square-free under the above condition.
Prove that if $\displaystyle \phi(n)|(n-1)$ then $\displaystyle n$ is prime, where $\displaystyle \phi(n)$. is the Euler's totient function.
I am able to show that $\displaystyle n$ is square-free under the above condition.