arXiv Analytics

Sign in

arXiv:1711.08313 [math.NT]AbstractReferencesReviewsResources

On the Lehmer's problem involving Euler's totient function

Huan Xiao

Published 2017-11-16Version 1

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.

Categories: math.NT
Subjects: 11A25
Related articles: Most relevant | Search more
arXiv:2007.05771 [math.NT] (Published 2020-07-11)
Gaps between totients
arXiv:2002.12155 [math.NT] (Published 2020-02-27)
Solutions of $φ(n)=φ(n+k)$ and $σ(n)=σ(n+k)$
arXiv:2303.16853 [math.NT] (Published 2023-03-29)
On Lehmer's problem and related problems

Links

Toolbox