The number of rational numbers determined by large sets of integers

preprint2009arXivOpen access

Abstract

When AA and BB are subsets of the integers in [1,X][1,X] and [1,Y][1,Y] respectively, with ∣A∣≥αX|A| \geq αX and ∣B∣≥βX|B| \geq βX, we show that the number of rational numbers expressible as a/ba/b with (a,b)(a,b) in A×BA \times B is ≫(αβ)1+εXY\gg (αβ)^{1+ε}XY for any ε>0ε> 0, where the implied constant depends on εε alone. We then construct examples that show that this bound cannot in general be improved to ≫αβXY\gg αβXY. We also resolve the natural generalisation of our problem to arbitrary subsets CC of the integer points in [1,X]×[1,Y][1,X] \times [1,Y]. Finally, we apply our results to answer a question of Sárközy concerning the differences of consecutive terms of the product sequence of a given integer sequence.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.