Counting integers with a smooth totient

2018/09/04 by William D. Banks, Banks, W. D., John Friedlander +5
Mathematics · #Advanced Mathematical Identities #Analytic Number Theory Research #FOS: Mathematics #Limits and Structures in Graph Theory #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.1809.01214

openalex publication_date 2018/09/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Related

• On the Lehmer's problem involving Euler's totient function
• A Generalisation of Euler Totient Function
• Some remarks on sum of Euler's totient function
• An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice
• Inequalities involving the primorial counting function