Given an integer n, prove that there exits at least one k for which n|φ(k)
Dirichlet's theorem says there is a prime so that $\displaystyle p\equiv 1(\bmod n)$.
Therefore let $\displaystyle k=p$ then $\displaystyle \phi (p) = p-1$ is divisible by $\displaystyle n$.