An algorithm for counting smooth integers

Abstract

© 2016, Pleiades Publishing, Ltd.An integer number n > 0 is called y-smooth for y > 0 if any prime factor p of n satisfies p ≤ y. Let ψ(x, y) be the number of all y-smooth integers less or equal to x. In this paper we elaborate a new algorithm for approximate calculation of ψ(x, y) at large x and relatively small y < log x.