Abstract not found

This paper presents lower bounds and upper bounds on the distribution of smooth integers; builds an algebraic framework for the bounds; shows how the bounds can be computed at extremely high speed using FFT-based power-series exponentiation; explains how one can choose the parameters to achieve any desired level of accuracy; and discusses several generalizations.

: An integer is called y-smooth if all of its prime factors are y. An important problem is to show that the y-smooth integers up to x are equi-distributed amongst short intervals. In particular, for many applications we would like to know that if y is an arbitrarily small, fixed power of x then all intervals of length p x, up to x, contain, asymptotically, the same number of y-smooth integers. We come close to this objective by proving that such y-smooth integers are so equi-distributed in intervals of length p xy 2+" , for any fixed " ? 0. * Partially supported by NSERC grant A5123 y An Alfred P. Sloan Research Fellow. Partially supported by the NSF. Smoothing "Smooth" Numbers John B. Friedlander and Andrew Granville Introduction. In this paper we will investigate the distribution, in short intervals, of integers without large prime factors . Good estimates, in such questions, have turned out to be surprisingly difficult. For instance, one might suppose that proving the ...