scientific article; zbMATH DE number 1381105

From MaRDI portal
Publication:3836760





For positive integers \(k,n\) and real \(x\) let \(\varphi_k(n)=\varphi (\varphi_{k-1}(n))\) and \(x_k=\log x_{k-1}\) be the \(k\)-fold iterate of the Euler totient function and the logarithm function, respectively. Denote by \(\omega (n)\) the number of distinct prime factors of \(n\) and denote by \(\Omega (n)\) the number of prime divisors of \(n\) counted with multiplicity. Among others the authors prove in the paper that for each \(k\geq 1\) the asymptotic equation \[ \Omega (\varphi_k(n))-\omega (\varphi_k(n))=(1+o(1)){1\over {k!}}x^k_2x_4 \] holds for almost all \(n\leq x\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3836760)