On a Lehmer problem concerning Euler's totient function
Copyright policy )On a Lehmer problem concerning Euler's totient function
\textit{D. H. Lehmer} [Bull. Am. Math. Soc. 38, 745--751 (1932; Zbl 0005.34302)] asked whether there exists any composite number \(n\) such that \(\varphi (n)| n-1\), that is, (*) \(M \varphi (n)=n-1\) for some \(M\). This question is still open. The present authors review some facts concerning (*) presented in the literature and show that if \(n\) satisfies (*) with \(M>4\), then the number of prime factors of \(n\) is much greater than \(M\), and that the set of all squarefree integers which do not fulfil (*) contains ``nice'' subsets.
Arithmetic functions; related numbers; inversion formulas, Lehmer's problem, 11A25, Euler's phi-function, Euler totient function, Lehmer problem
Arithmetic functions; related numbers; inversion formulas, Lehmer's problem, 11A25, Euler's phi-function, Euler totient function, Lehmer problem
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!