Counting integers with a smooth totient
Number Theory
2018-09-06 v1
Abstract
We fix a gap in our proof of an upper bound for the number of positive integers for which the Euler function has all prime factors at most . While doing this we obtain a stronger, likely best-possible result.
Cite
@article{arxiv.1809.01214,
title = {Counting integers with a smooth totient},
author = {W. D. Banks and J. B. Friedlander and C. Pomerance and I. E. Shparlinski},
journal= {arXiv preprint arXiv:1809.01214},
year = {2018}
}