A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.
01
The problem
Let Y(x) be the maximal y such that there exists a choice of congruence classes a_p for all primes p≤ x such that every integer in [1,y] is congruent to at least one of the a_p\pmod{p}. Give good estimates for Y(x). In particular, can one prove that Y(x)=o(x^2) or even Y(x)≪ x^(1+o(1))?
Open since1979earliest source
Last checked2026.07.26Catalog verification
02
Reward offers
Offer 01$1000Paul Erdős / Combinatorics Foundation
Documented03