  By using the elementary symmetric polynomials and some results of number
theory, we solve the well known problem of Lehmer on Euler's totient function.
As application, we obtain a new characterization of prime numbers.
