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)?
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:9079eae78f5bc8cbc671c5c9db7ee61c3088a47a502cca4111e665bee51a1d86
- Metadata
- sha256:46ee617fca3cf43ff5e12e5a213e38d2d00cf60b5f888ed4bb65d5b41e8f33b5
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:96ae42b79cd11fcc30fe92c2d606656d7dd9825e9b3ab44f48b180366dc65c18
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207