MathNet 2008-part-02 — 165 problems (EN–VI) Question 40

Suppose $n$ is a composite number such that $\varphi(n)$ divides $n-1$, where $\varphi$ denotes Euler's totient function. Show that $n$ has at least four distinct prime factors.