A new characterization of prime numbers and solution to Lehmer's conjecture on Euler's totient function

2023/02/14 by Zriaa, Said
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/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.

Related

• On the Lehmer's problem involving Euler's totient function
• On the Lehmer Numbers, II
• On k-Lehmer numbers
• An analytical proof for Lehmer's totient conjecture using Mertens' theorems
• Generalizing the Lehmer's totient problem