A new characterization of prime numbers and solution to Lehmer's conjecture on Euler's totient function
arXiv:2302.07368
Abstract
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.
arXiv commentthere was an error in Theorem 2.3