On the number of prime factors of \(\varphi{} (\varphi{}(n))\)

DOI10.1007/BF01903562zbMath0751.11041OpenAlexW2048576215MaRDI QIDQ1187314

Imre Kátai

Publication date: 28 June 1992

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01903562

zbMATH Keywords

sum of divisorsBrun-Titchmarsh theoremBombieri-Vinogradov theoremstrongly additive functionsErdős-Kac theoremGaussian limit lawnumber of prime divisorsTurán-Kubilius inequalitydistribution of additive functionscomposition of additive and multiplicative functionsEuler's \(\varphi\)-functionnormal number of prime factors

Mathematics Subject Classification ID

Arithmetic functions in probabilistic number theory (11K65)

Related Items (4)

Number of prime divisors of \(\varphi_ k(n)\), where \(\varphi_ k\) is the \(k\)-fold iterative of \(\varphi\) ⋮ Unnamed Item ⋮ On the local distribution of certain arithmetic functions ⋮ On the greatest common divisor of a number and its sum of divisors

Cites Work

• An analogue of the Erdős-Kac theorem for Fourier coefficients of modular forms
• Prime divisors of Fourier coefficients of modular forms
• On the normal number of prime factors of \(\phi(n)\)
• On the Sieve of Eratosthenes
• On the large sieve
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of prime factors of \(\varphi{} (\varphi{}(n))\)