The Lehmer problem on the Euler totient: a Pendora's box of unsolvable problems. (Q4407953)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1944636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Lehmer problem on the Euler totient: a Pendora's box of unsolvable problems. |
scientific article; zbMATH DE number 1944636 |
Statements
2002
0 references
Euler totient
0 references
0.8929014801979065
0 references
0.8246046304702759
0 references
0.8207611441612244
0 references
0.8149458169937134
0 references
The Lehmer problem on the Euler totient: a Pendora's box of unsolvable problems. (English)
0 references
A seventy year old, still unsolved problem of D. H. Lehmer is: are there composite numbers satisfying \(\varphi(n)\mid (n-1)\)? \((\varphi(n)\) is the Euler totient). An equivalent formulation is the following: do there exist distinct odd primes \(p_1,\dots, p_r\) with \(r>1\) such that \[ p_1 p_2\cdots p_r-1\equiv 0\bmod (p_1-1)\cdots (p_r-1)? \] The author notes more general problems like \[ p_1^{a_1} p_2^{a_2} \cdots p_r^{a_r}-1 \equiv 0\bmod (p_1^{a_1}-1) \cdots (p_r^{a_r}-1), \quad a_1,\dots, a_r\in \mathbb{N} \] and like \[ (p_1+a) \cdots (p_r+a)-1 \equiv 0\bmod (p_1+a-1) \cdots (p_r+a-1), \quad a\in \mathbb{N}, \] and he gives some partial results in this direction. For the entire collection see [Zbl 0997.00018].
0 references