Erdős Problem #689 — Let n be sufficiently large.
Statement
Let be sufficiently large. Is there some choice of congruence class for all primes such that every integer in satisfies at least two of the congruences ?
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.