The Multiplication table for Smooth integers
Number Theory
2017-07-31 v1
Abstract
The Erd\H{o}s multiplication table problem asks what is the number of distinct integers appearing in the multiplication table. The order of magnitude of this quantity was determined by Ford in 2008. In this paper we study the number of smooth entries of the multiplication table that is to say entries with no prime factors greater than .
Keywords
Cite
@article{arxiv.1707.09048,
title = {The Multiplication table for Smooth integers},
author = {Marzieh Mehdizadeh},
journal= {arXiv preprint arXiv:1707.09048},
year = {2017}
}