Erdős problem 689
Let n be sufficiently large. Is there some choice of congruence class a_p for all primes 2 ≤ p ≤ n such that every integer in [1,n] satisfies at least two of the congruences ≡ a_p (mod p)?
Nothing has been recorded here yet.
How far the record reaches3 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal1 retained
- ResolutionNone filed
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingResolution
No source retained here records an outcome for this question.
Its collection still marks it open.
Where the source files it575 share a topic
Erdős problem 321acceptedCarrying a Standing. Browse the topic.