The Multiplication table for Smooth integers

Abstract

The Erdős multiplication table problem asks what is the number of distinct integers appearing in the $N\times N$ multiplication table. The order of magnitude of this quantity was determined by Ford in 2008. In this paper we study the number of $y-$smooth entries of the $N\times N$ multiplication table that is to say entries with no prime factors greater than $y$.