Counting integers with a smooth totient

DOI10.1093/QMATHJ/HAZ026zbMATH Open1475.11177OpenAlexW2973097972MaRDI QIDQ5000351FDOQ5000351

Authors: William D. Banks, J. B. Friedlander, Carl Pomerance, Igor E. Shparlinski 

Publication date: 12 July 2021

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Abstract: We fix a gap in our proof of an upper bound for the number of positive integers $nlex$ for which the Euler function $varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

Full work available at URL: https://arxiv.org/abs/1809.01214

Recommendations

• On the distribution of totients
• On the distribution of the Euler function of shifted smooth numbers
• The distribution of totients
• A note on square totients
• How often is Euler's totient a perfect power?

zbMATH Keywords

arithmetic functionsEuler's totient functionsmooth integersasymptotic of arithmetic functions

Mathematics Subject Classification ID

Distribution of integers with specified multiplicative constraints (11N25) Other results on the distribution of values or the characterization of arithmetic functions (11N64) Distribution functions associated with additive and positive multiplicative functions (11N60)

Cited In (2)

• Some thoughts on pseudoprimes
• Popular subsets for Euler's \(\varphi \)-function

This page was built for publication: Counting integers with a smooth totient

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