Erdős Problem #1200
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, primes.
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.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1200 has maintained status OPEN — MANDATORY CRITICAL at this audit.
Erdős–Ruzsa ask whether there is one absolute constant \(C\) such that for every sufficiently large real \(x\) one can choose distinct primes \(p_1<\cdots<p_k<x\) and one residue class \(a_i\bmod p_i\) per prime, with
and every positive integer \(n<x\) belonging to at least one selected class. This is coverage of a finite initial interval, not a distinct covering system of all integers; imposing all-integer periodic coverage would change the question. The primes and residue classes may depend on \(x\), but \(C\) must not. The related opposite ErRu80 question asks whether for every fixed reciprocal-sum bound all residue assignments leave a positive proportion of the interval uncovered; proving that would disprove the covering conjecture.
A small example
For \(x=12\), the only available primes are \(2,3,5,7,11\). Independently enumerate every choice of no class or exactly one class per prime: \((2+1)(3+1)(5+1)(7+1)(11+1)=6912\) assignments. Exactly 14 cover all integers \(1,\dots,11\). The minimum reciprocal mass among these 14 is \(2927/2310\) for the classes \((0\bmod2),(0\bmod3),(1\bmod5),(0\bmod7),(5\bmod11)\). This finite minimum is NOT a universal bound \(C\), and covering the initial interval is NOT the same as covering all integers.
What is known
The maintained catalogue https://www.erdosproblems.com/1200 leaves this OPEN, originally [Er80,p.106] and Erdős–Ruzsa [ErRu80]. Their published partial result: for fixed \(C>0\) there exist prime families with \(\sum1/p\le C\) whose zero-residue divisibility classes cover a positive proportion \(\gg_C x\), far weaker than all of \([1,x)\). The page connects #688: a uniform positive lower bound for a separate epsilon parameter would imply this statement. No general bounded-reciprocal-sum covering or unavoidable-uncovered-density theorem was source-certified by GCL.
GCL's current state
Authenticated original issue-bound research return. The bounded mathematical fixture was independently replayed through ci/erdos_compendium_007_phase24_checks.py. All external advanced/general theorem statements remain attributed to sources, not independently certified. This is a local UNACCEPTED editorial manuscript.
What remains
Mandatory #1200 independent critical sample. Verify Er80 p.106 and ErRu80 precisely, including strict prime \(p<x\) and finite interval endpoints; independently rerun the 6912-assignment exhaustive search and optimality of \(2927/2310\). Source-review the epsilon relation to #688 and analyze whether Fourier/sieve or finite-class uncovered-density lower bounds could give a general obstruction. An independent nonauthor critic must explicitly APPROVE/REVISE the scoped audit before counting any critical-review approval.
Independent source fidelity and critical mathematical review, protected publication, actual public deployment and V2 admission remain separate uncompleted obligations.
Sources and claim boundaries
https://www.erdosproblems.com/1200 ; [Er80,p.106],[ErRu80], related #688,#783,#784.
Exact finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE24.json. Original source issue frozen SHA retained; no independent certificate claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2471 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.