M. Venkata Subbarao
Abstract
The celebrated seventy year old, innocent looking problem of D.H. Lehmer [5] asking for composite numbers, if any, satisfying the relation φ(n)|(n − 1), where φ(n) is the Euler totient, is still unsolved. This is easily seen to be equivalent to asking the
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The celebrated seventy year old, innocent looking problem of D.H. Lehmer [5] asking for composite numbers, if any, satisfying the relation φ(n)|(n − 1), where φ(n) is the Euler totient, is still unsolved. This is easily seen to be equivalent to asking the
Key concepts: Euler's totient function, Euler's formula, Mathematics, Arithmetic, Mathematical analysis