The number of rational numbers determined by large sets of integers
From MaRDI portal
Publication:3570189
Abstract: When and are subsets of the integers in and respectively, with and , we show that the number of rational numbers expressible as with in is for any , where the implied constant depends on 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 of the integer points in . 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.
Recommendations
Cited in
(13)- On the quotient sequence of sequences of integers
- On the product sets of rational numbers
- Quotients of dense subsets of integers and short distances between product elements
- On the size of the set of the product of sets of rational numbers
- Ratio sets of random sets
- scientific article; zbMATH DE number 6686864 (Why is no real title available?)
- Quotient Sets and Diophantine Equations
- The number of rationals determined by large sets of sifted integers
- Rational numbers in ×𝑏-invariant sets
- Analytic number theory in India during 2001-2010
- On the distribution of the digits of quotients of integers and primes
- Quotient and product sets of thin subsets of the positive integers
- On the multiples
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)