How to solve $\phi(n)=n$ for $n$?

Question

I wish to solve $\phi(n)=n$ for $n$ where $\phi(n)$ is the Euler's Totient function.

I solved this by splitting this into three possible cases:

($1$) $n$ is prime

($2$) $n$ is composite

($3$) $n=1$.

($1$) gives contradiction as $\phi(n)=n-1\not=n$.

($2$) gives contradiction as $\phi(n)\geq\frac{1}{2}n$.

($3$) Works and is the only left choice so we conclude that $n=1$.

Is there a nicer way to answer this question?

Answer 1

There are only $n-1$ positive integers below $n$, so unless $\gcd(n, n) = 1$ we must have $\phi(n)\leq n-1$.

Answer 2

Note that $$n=\phi(n)=n\prod_p\left(1-\frac1p\right)=n\implies\prod_p\left(1-\frac1p\right)=1$$ which does not hold for any primes $p$, forcing $n=1$.