2000 character limit reached
On the Lehmer's problem involving Euler's totient function
Published 16 Nov 2017 in math.NT | (1711.08313v2)
Abstract: The Euler's totient function $ \varphi(n) $ counts the positive integers up to a given integer $ n$ that are relatively prime to $ n $. We solve a problem due to Lehmer that there is no composite number $ n $ such that $ \varphi(n)\mid n-1 $. We also note that there are infinitely many primes that are not Sophie Germain primes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.