Number of prime divisors of _ k(n), where _ k is the k-fold iterative of
DOI10.1006/JNTH.1997.2164zbMATH Open0878.11036OpenAlexW2050631933MaRDI QIDQ1363095FDOQ1363095
Imre Kátai, M. Wijsmuller, N. L. Bassily
Publication date: 17 August 1997
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jnth.1997.2164
Recommendations
- scientific article; zbMATH DE number 1336415
- On the number of prime factors of \(\varphi{} (\varphi{}(n))\)
- scientific article; zbMATH DE number 3632603
- scientific article
- scientific article
- scientific article; zbMATH DE number 7236662
- Divisibility of the κ-fold iterated divisor function of n into n
- scientific article; zbMATH DE number 3533003
- scientific article; zbMATH DE number 2185814
- On the distribution of the number of prime factors of the \(k\)-fold iterate of various arithmetic functions
sieve methodsEuler's totient functionGaussian limit lawBombieri additive functions[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn-Kubilius+inequality+Erd%EF%BF%BD%EF%BF%BDs-Kac+theorem&go=Go Tur��n-Kubilius inequality Erd��s-Kac theorem]
Arithmetic functions; related numbers; inversion formulas (11A25) Asymptotic results on arithmetic functions (11N37) Arithmetic functions in probabilistic number theory (11K65) Applications of sieve methods (11N36)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the normal number of prime factors of \(\phi(n)\)
- On the large sieve
- On the number of prime factors of \(\varphi{} (\varphi{}(n))\)
- An analogue of the Erdős-Kac theorem for Fourier coefficients of modular forms
- Title not available (Why is that?)
Cited In (8)
- Distribution Functions of the Sequence φ(m)/m, m ∈ (k, k + N) as k, N go to Infinity
- Title not available (Why is that?)
- On the normal order of \(\varphi_{k+1}(n)/\varphi_k(n)\), where \(\varphi_k\) is the \(k\)-fold iterate of Euler's function
- On the number of prime divisors of the iterates of the Carmichael function
- Prime chains and Pratt trees
- On the equations ϕ(n) = ϕ(n + k) and ϕ(p − 1) = ϕ(q − 1)
- Numbers of the form kf(k)
- Two remarks on iterates of Euler's totient function
This page was built for publication: Number of prime divisors of \(\varphi_ k(n)\), where \(\varphi_ k\) is the \(k\)-fold iterative of \(\varphi\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363095)
