Integers with a divisor in (y,2y]

Abstract

We give a relatively short proof of one of the central cases of the main theorem from the paper "The distribution of integers with a divisor in a given interval", math.NT/0401223. Namely, we determine the order of magnitude of the number of integers <=x with a divisor in (y,2y]. The lower bound uses a different argument than that in the aforementioned paper. As a corollary, we deduce the order of magnitude for the number of distinct products in an N x N multiplication table.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…