Number of prime divisors of \(\varphi_ k(n)\), where \(\varphi_ k\) is the \(k\)-fold iterative of \(\varphi\) (Q1363095)

Let \(\varphi(n)\) be Euler's totient function and define \(\varphi_k(n)=\varphi_{k-1}(\varphi(n))\) for \(k\geq1\), with \(\varphi_0(n)=n\). Let \(\omega(n)\) denote the number of distinct prime divisors of \(n\), and write \(a_k=1/(k+1)!\), \(b_k=1/\sqrt{2k+1} (k!)\). The main result of the paper states that, for fixed \(k\geq1\), the limit \[ \lim_{x\to\infty}{1\over x} \;\# \left\{n\leq x:{w(\varphi_k(n))-a_k(\log\log x)^{k+1}\over b_k(\log\log x)^{k+1/2}}<z\right\} \] obeys the Gaussian limit law with the parameter \(z\). The case \(k=1\) was established earlier by \textit{P. Erdös} and \textit{C. Pomerance} [Rocky Mt. J. Math. 15, 343-352 (1985; Zbl 0617.10037)], and also \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)]. The case \(k=2\) was established by \textit{I. Kátai} [Acta Math. Hung. 58, No. 1/2, 211-225 (1991; Zbl 0751.11041)]. The authors also show that the law still holds when \(n\) is replaced by \(p-1\) for primes \(p\), and \(x\) replaced by \(\pi(x)\). The estimation for \(\omega(\varphi_k(n))\) is complicated when \(k\geq2\). The authors use sieve theory together with tools such as Bombieri's theorem to obtain suitable approximations to \(\omega(\varphi_k(n))\) in terms of a strongly additive function. The Turán-Kubilius inequality and the Erdös-Kac theorem are then employed to give the desired results.