Erdős Problem #689
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
For each sufficiently large n, Erdős asks whether one can select one residue class modulo every prime p≤n so that each integer 1,…,n belongs to at least TWO selected classes. The two matches must use distinct primes, not repeated counting of a class. A generalized question replaces two by any fixed r. The maintained status is OPEN and a claimed solution in its public discussion is explicitly not automatically verified or editorially adopted.
A small example
For n=5, exhaustive exact enumeration over one residue each modulo primes 2,3,5 finds maximum minimum coverage exactly one, not two. At n=10 the same search over 2,3,5,7 yields maximum minimum coverage zero: no assignment even covers every position once. These small failures do not refute a statement that concerns sufficiently large n. Each assignment has finitely many possibilities: ∏_{p≤n}p.
What is known
The related single-cover problem is #687. Choosing residues at random gives expected coverage of a fixed integer Σ_{p≤n}1/p, which grows like loglog n, but high average does not guarantee a uniform minimum of two for every one of n positions. For each prime p, its chosen class hits either floor(n/p) or ceil(n/p) positions, so a necessary (not sufficient) total-incidence condition is Σ_{p≤n}ceil(n/p)≥2n. The pinned FormalConjectures/ErdosProblems/689.lean at 85f863718beeec7b58a3a1926ee92e3472bc2020 precisely counts distinct qualifying primes and has a by sorry parent statement; no GCL proof. The maintained forum includes AI-assisted proposed proofs whose main weighted prime-pattern lemma is explicitly still requesting verification; do not promote a proposed PDF as an established resolution.
GCL's current state
The original authenticated RESULT/1 source return has historical disposition PARTIAL. This status and the original research exceptions are preserved, not silently converted into a theorem verdict. The maintained Erdős source and source-specific mathematical definitions were reviewed, and this article is editorially reviewed as a source-exception-annotated explanation under EC-BULK-005-R10, effective only after the exact-hash protected admission merges.
Source interpretation and unresolved mathematical qualification: Mean prime-residue incidence above two does not guarantee two hits at every position; AI-assisted claims and pinned sorry remain unchecked.
The explanation is accepted for publication of established background, examples, and explicitly attributed current claims. It does not establish or formally certify the disputed original theorem, external model-assisted proof, historical interpretation, or any unreplayed Lean kernel file. Original source-fidelity and proof-review research holds remain.
What remains
Turn the claimed fractional hypergraph-cover argument into one bounded claim: identify and independently check its four local-factor identities and the exact form of the finite-complexity prime-pattern theorem it invokes; alternatively prove a finite satisfiability/unsatisfiability certificate for a named n using exhaustive residue search. Do not infer eventual all-n existence from isolated finite successes. Original Erdős [Er79d] and [Er80,p.108] exact pages remain due.
Sources and claim boundaries
Maintained problem #689; https://www.erdosproblems.com/689 ; https://www.erdosproblems.com/forum/thread/689 ; https://github.com/google-deepmind/formal-conjectures/blob/85f863718beeec7b58a3a1926ee92e3472bc2020/FormalConjectures/ErdosProblems/689.lean ; original Erdős papers not directly inspected. GCL original issue return. Historical source pages and full theorem proofs not uniformly inspected. No novel theorem, full CI, public MathJax readback, protected merge or V2 admission.
Qualified editorial critical review: R10 source-exception dossier. The source-semantic exception is visible and its original research hold remains. Publication classification: REVIEWED EXPLANATORY ARTICLE WITH UNRESOLVED SOURCE/PROOF QUALIFICATIONS. Independent theorem proof or Lean certification: NOT CLAIMED.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1960 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.