On the Erdős covering problem: the density of the uncovered set

Abstract

Since their introduction by Erdős in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding the existence of covering systems with various properties. In particular, Erdős asked if the moduli can be distinct and all arbitrarily large, Erdős and Selfridge asked if the moduli can be distinct and all odd, and Schinzel conjectured that in any covering system there exists a pair of moduli, one of which divides the other. Another beautiful conjecture, proposed by Erdős and Graham in 1980, states that if the moduli are distinct elements of the interval [n, Cn], and n is sufficiently large, then the density of integers uncovered by the union is bounded below by a constant (depending only on C). This conjecture was confirmed (in a strong form) by Filaseta, Ford, Konyagin, Pomerance and Yu in 2007, who moreover asked whether the same conclusion holds if the moduli are distinct and sufficiently large, and ∑i=1k1di 0. We also show that no such lower bound (i.e., depending only on C) on the density of the uncovered set holds when μ(pi) is replaced by any function of the form 1 + O(1 / p). Our method has a number of further applications. Most importantly, as our second main theorem, we prove the conjecture of Schinzel stated above, which was made in 1967. We moreover give an alternative (somewhat simpler) proof of a breakthrough result of Hough, who resolved Erdős’ minimum modulus problem, with an improved bound on the smallest difference. Finally, we make further progress on the problem of Erdős and Selfridge.

Publication Title

Inventiones Mathematicae

Link to Full Text

Share

COinS