Math Help - Number Theory

1. Number Theory

Hi. I am a little confused. Please Help!

Given an integer n, prove that there exits at least one k for which n|φ(k)

2. Originally Posted by tret
Hi. I am a little confused. Please Help!

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 $p\equiv 1(\bmod n)$.
Therefore let $k=p$ then $\phi (p) = p-1$ is divisible by $n$.