On the number of prime factors of \(\varphi{} (\varphi{}(n))\) (Q1187314): Difference between revisions

The author obtains a Gaussian limit law for the function \(n\mapsto\omega(\varphi(\varphi(n)))\), more exactly he proves \[ \lim{1\over x}\cdot\#\left\{n\leq x,{\omega(\varphi(\varphi(n)))-{1\over 6}(\log\log n)^ 3\over{1\over\sqrt{10}}\cdot(\log\log n)^{5/2}}\right\}=\Phi(y). \] The author states that by his method he is able to give corresponding results for functions \(f(g(n))\) instead of \(\omega(\varphi(\varphi(n)))\), where \(f=\omega\) or \(f=\Omega\), and \(g=\sigma\circ\varphi\) or \(g=\varphi\circ\sigma\) or \(g=\sigma\circ\sigma\) or \(g=\varphi\circ\varphi\). These results extend former investigations of \textit{P. Erdős} and \textit{C. Pomerance} [Rocky Mt. J. Math. 15, 343-352 (1985; Zbl 0617.10037)], \textit{M. Ram Murty} and \textit{V. Kumar Murty} [Duke Math. J. 51, 57-76 (1984; Zbl 0537.10026); Indian J. Pure Appl. Math. 15, 1090-1101 (1984; Zbl 0557.10033)], who treated the function \(\omega\circ\varphi\), and of the author himself [Ann. Univ. Sci. Budap. Rolando Eötvös Sect. Math. 34, 217-225 (1991); see the preceding review], who showed that \[ {\omega(\sigma(p+1))-{1\over 2}(\log\log p)^ 2\over (1/\sqrt 3)\cdot(\log\log p)^{3/2}} \] is distributed according to the Gaussian law. The proof uses the idea of approximating \(\omega(\varphi(\varphi(n)))\) by a sum of two strongly additive functions, and relies heavily on (standard) tools like the Bombieri-Vinogradov theorem, sieve estimates, the Turán-Kubilius inequality, and the Erdős-Kac theorem.