On the normal number of prime factors of \(\phi(n)\)

DOI10.1216/RMJ-1985-15-2-343zbMath0617.10037OpenAlexW2018226616WikidataQ105890387 ScholiaQ105890387MaRDI QIDQ1821814

Carl B. Pomerance

Publication date: 1985

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1216/rmj-1985-15-2-343

zbMATH Keywords

number of prime factorsstandard deviationnormal orderEuler phi-function

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Arithmetic functions in probabilistic number theory (11K65)

Related Items (30)

Counting terms $U_n$ of third order linear recurrences with $U_n=u^2+nv^2$ ⋮ Number of prime divisors of \(\varphi_ k(n)\), where \(\varphi_ k\) is the \(k\)-fold iterative of \(\varphi\) ⋮ The distribution of totients ⋮ Prime chains and Pratt trees ⋮ An all-purpose Erdős-Kac theorem ⋮ Popular subsets for Euler's \(\varphi \)-function ⋮ On the normal number of prime factors of \(\varphi(n)\) subject to certain congruence conditions ⋮ Effective means for complex multiplicative functions ⋮ Square-free values of the Carmichael function. ⋮ An arithmetic function arising from Carmichael's conjecture ⋮ A prime analogue Erdős-Pomerance result for Drinfeld modules with arbitrary endomorphism rings ⋮ On the number of prime factors of \(\varphi{} (\varphi{}(n))\) ⋮ The average number of divisors of the Euler function ⋮ Anatomy of torsion in the CM case ⋮ On the number of prime factors of values of the sum-of-proper-divisors function ⋮ On the number of sparse RSA exponents ⋮ Some theorems on multiplicative orders modulo \(p\) on average ⋮ On an Erdős-pomerance conjecture for rank one Drinfeld modules ⋮ THE DISTRIBUTION OF THE NUMBER OF SUBGROUPS OF THE MULTIPLICATIVE GROUP ⋮ Average results on the order of \(a\) modulo \(p\) ⋮ Complexity of inverting the Euler function ⋮ A Carlitz module analogue of a conjecture of Erdos and Pomerance ⋮ A concentration property with respect to the Euler function ⋮ Variations on a theme by Akl and Taylor: security and tradeoffs ⋮ Counting composites with two strong liars ⋮ On the equations ϕ(n) = ϕ(n + k) and ϕ(p − 1) = ϕ(q − 1) ⋮ Artin's conjecture on average for composite moduli ⋮ Values of the Euler function in various sequences ⋮ The Number of Non-cyclic Sylow Subgroups of the Multiplicative Group Modulo n ⋮ Compositions with the Euler and Carmichael functions

This page was built for publication: On the normal number of prime factors of \(\phi(n)\)