← All problems

Erdős Problem #1200 — Bounded reciprocal mass covering finite intervals

46 years old · traced to

Does there exist an absolute constant C>0C>0 such that, for every sufficiently large real number XX, there are a positive integer kk, distinct primes p1<⋯<pk<Xp_1<\cdots<p_k<X, and integers a1,…,aka_1,\ldots,a_k for which

∑i=1k1pi<C,\sum_{i=1}^k \frac{1}{p_i}<C,

and every integer nn with 1≤n<X1\le n<X satisfies at least one of

n≡ai(modpi)(1≤i≤k)?n\equiv a_i\pmod{p_i}\qquad (1\le i\le k)?

The primes, residues, and kk may depend on XX, but CC must not. Erdős Problems #1200 Erdős (1980), p. 106

Background

Erdős introduced this question in his 1980 survey’s discussion of sieve methods, attributing the conjecture to Ruzsa and himself and calling it “surprising.” It asks whether a finite initial interval can be covered by one residue class for each of a collection of primes below its endpoint, while the sum of the reciprocal primes stays bounded independently of the interval’s length. The issue is not whether the classes cover a positive proportion, but whether they can cover every integer in the interval. Erdős (1980), p. 106 Erdős Problems #1200

References

P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.

Source: P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.