The Multiplication table for Smooth integers

2017/07/27 by Mehdizadeh, Marzieh
#11N25 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1707.09048

Abstract

The Erdős multiplication table problem asks what is the number of distinct integers appearing in the N× 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× N multiplication table that is to say entries with no prime factors greater than y.

Related

• Erdős' Multiplication Table Problem for Function Fields and Symmetric Groups
• A Combinatorial Method for Counting Smooth Numbers in Sets of Integers
• Effective Khovanskii, Ehrhart Polytopes, and the Erdős Multiplication Table Problem
• An extension of smooth numbers: multiple dense divisibility
• Counting integers with a smooth totient