Some analogues of a Lehmer problem on the totient function (Q1071041)

In 1932 D. H. Lehmer asked whether or not there is a composite number \(n\) such that \(M\varphi (n)=n-1\), where \(\varphi\) is Euler's totient function and \(M\) is an integer greater than one. While this question is still open it has been proved by \textit{G. L. Cohen} and the reviewer [Nieuw Arch. Wiskd., III. Ser. 28, 177--185 (1980; Zbl 0436.10002)] that if such an \(n\) exists then \(n>10^{20}\) and \(\omega(n)\geq 14\), where \(\omega (n)\) is the number of distinct prime factors of \(n\). In the present paper the analogous question is discussed for the Jordan totient function of order \(k\), defined by \(J_ k(n)=n^ k\prod_{p | n}(1-p^{-k}),\) and the unitary totient function, defined by \(\varphi^*(n)=\prod_{p^{\alpha} \| n}(p^{\alpha}-1).\) It is proved that if \(k>1\) then \(J_ k(n) | (n^ k-1)\) if and only if \(n\) is a prime. A number of results are obtained for the set \(S^*_ M\) of integers \(n\) such that \(M\varphi^*(n)=n-1\) where \(M>1\). For example, it is shown that if \(n\in S^*_ M\) then \(n\) is odd, \(n\) is not powerful and \(\omega (n)>10\). It is also proved that if the number of \(n\) in \(S^*_ M\) which do not exceed \(x\) is denoted by \(N^*(x)\) then \[ N^*(x)=O(x^{1/2} \log^ 2 x \cdot (\log \log x)^{-2}). \] (Remark. While Lemma 5.2 is probably true its proof is marred by the statement that \(M(\varphi^*(m)/m)\geq 2\). This inequality is obviously false if \(M=2\) since \(\varphi^*(m)/m<1\).)