Erdős Problem #687 — 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_ppmodp.
Statement
Let be the maximal such that there exists a choice of congruence classes for all primes such that every integer in is congruent to at least one of the . Give good estimates for . In particular, can one prove that or even ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.