Positive integers whose Euler function is a power of their kernel function (Q2477811): Difference between revisions

Let \(\gamma(n)= \prod_{p|n} p\), \(\sigma\) be the sum of divisors function and \(\varphi\) be Euler's function. The first author asked for the set of positive integers \(n\) satisfyng \(f(n)=\gamma(n)^2\) when \(f=\sigma\) or \(\varphi\). This problem was investigated for \(f=\sigma\) by the second author in [Result. Math. 45, No. 1--2, 79--87 (2004; Zbl 1195.11133)] but it is not known whether the number of solutions is finite or infinite. The six solutions in the case \(f=\varphi\) are found in the current paper, and a more general problem is investigated. Let \(N_k\) denote the number of positive integers \(n\) such that \((*)\) \(\varphi(n)= \gamma(n)^k\), where \(k\geq 1\). The authors study the size of \(N_k\) in terms of \(k\); more precisely it is shown that there exist computable constants \(c_1\) and \(c_2\) such that for all \(k\geq 1\) \[ \exp(c_1 k\log k)< N_k< \exp(c_2 k^2). \] They also obtain the upper bound \(3^{(k+1)^{k+2}}\) for the largest solution \(n\) of equation \((*)\). The arguments are combinatorial in nature and intricate, with the establishment of the lower bound for \(N_k\) requiring the more complicated proof. The set of solutions of \((*)\) when \(k=1,2,3\) are calculated, and \texttt{MATHEMATICA} is used to compute the 85 integers \(n\) satisfying \((*)\) when \(k= 4\) and to show that \(N_5= 969\).