On a problem of Erdös and Szemerédi

https://doi.org/10.1016/0022-314X(86)90012-0Get rights and content
Under an Elsevier user license
open archive

Abstract

In 1966 P. Erdös proved the following theorem:

Let B = {bi: 1 < b1 < b2 < b3 < …} be an infinite sequence of integers, such that (bi,bj=1for all i ≠ j and 1=i1bi<∞

Then there exists a constant 0 < α < 1 with the following property: For sufficiently large x the interval (xxα, x] contains integers, that are divisible by no element of B. Szemerédi showed that Erdös' theorem holds true for α = 12 + ϵ and in our paper we prove, that 12 + ϵ may be replaced by 920 + ϵ. The proof uses nontrivial estimates of exponential sums.

Cited by (0)