On the forms of n for which \(\phi\) (n) \(| \,n-1\) (Q1824645)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the forms of n for which \(\phi\) (n) \(| \,n-1\) |
scientific article; zbMATH DE number 4118427
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the forms of n for which \(\phi\) (n) \(| \,n-1\) |
scientific article; zbMATH DE number 4118427 |
Statements
On the forms of n for which \(\phi\) (n) \(| \,n-1\) (English)
0 references
1989
0 references
\textit{D. H. Lehmer} [Bull. Am. Math. Soc. 38, 745-751 (1932; Zbl 0005.34302)] asked whether there is any composite number n for which \(\phi (n) | (n-1).\) This is yet an unsolved problem but several partial solutions have been given, see \textit{P. Hagis} [Nieuw Arch. Wiskd., IV. Ser. 6, No. 3, 255-261 (1988; Zbl 0668.10006)]. In the present paper the authors find several forms in which the composite n satisfying \(\phi (n) | (n-1)\) should be if it exists. For example, they prove that if \(3| n\), then n is of the form \(2^{14}3^ 2m+81921\) or \(2^{14}3^ 2m+131073\) according as the number of prime factors of n is odd or even. This result can be further improved using the results of a recent paper by Hagis.
0 references
Euler's totient function
0 references
Lehmer's equation
0 references
Euler phi-function
0 references