The Multiplication table for Smooth integers
Abstract
The Erdos 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.