Counting integers with a smooth totient

Autor: Banks, W. D., Friedlander, J. B., Pomerance, C., Shparlinski, I. E.
Rok vydání: 2018
Předmět:
Druh dokumentu: Working Paper
Popis: We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ 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.
Databáze: arXiv