Counting integers with a smooth totient
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.