The number of rational numbers determined by large sets of integers

From MaRDI portal
Publication:3570189

DOI10.1112/BLMS/BDQ021zbMATH Open1205.11016arXiv0903.2714OpenAlexW2002366236MaRDI QIDQ3570189FDOQ3570189


Authors: Javier Cilleruelo, D. S. Ramana, Olivier Ramaré Edit this on Wikidata


Publication date: 24 June 2010

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Abstract: When A and B are subsets of the integers in [1,X] and [1,Y] respectively, with |A|geqalphaX and , we show that the number of rational numbers expressible as a/b with (a,b) in AimesB is for any epsilon>0, where the implied constant depends on epsilon alone. We then construct examples that show that this bound cannot in general be improved to . We also resolve the natural generalisation of our problem to arbitrary subsets C of the integer points in [1,X]imes[1,Y]. Finally, we apply our results to answer a question of S'ark"ozy concerning the differences of consecutive terms of the product sequence of a given integer sequence.


Full work available at URL: https://arxiv.org/abs/0903.2714




Recommendations





Cited In (13)





This page was built for publication: The number of rational numbers determined by large sets of integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3570189)