arXiv · 1707.09048
The Multiplication table for Smooth integers
Abstract
The Erd\H{o}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$.
Explore related subjects
Keep this discovery
Marzieh Mehdizadeh. 2017-07-27. The Multiplication table for Smooth integers. https://arxiv.org/abs/1707.09048
Cite the original work for its findings. Save a collection to share your selection of sources.