Erdős Problem #1205
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: solved (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.
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 #1205 has maintained status SOLVED — ASYMPTOTIC REPORT at this audit.
For each integer modulus \(1\le n\le x\), choose exactly one residue class \(a_n\bmod n\). Let \(F(x)\) be the largest number such that every positive integer \(m\le x\) lies in at least \(F(x)\) of the chosen residue classes. This is a multiplicity covering problem, not the one-hit covering in #1200. Modulus \(1\) contributes one unavoidable hit for every \(m\); allowing one class for every composite modulus is central. The asymptotic question is whether the optimum is \(\sim\log x\).
A small example
Exhaustively choose one residue for each \(n=1,\dots,x\) for \(2\le x\le8\); there are \(x!\) assignments. For \(x=2,3,4\), the exact maximum minimum multiplicities are 1,2,2, respectively; the receipt stores the maximizing residue vectors for all \(x\le8\). This is a finite verification of the definition, not a proof of the \(\log x\) asymptotic or its concentration error.
What is known
The maintained https://www.erdosproblems.com/1205 records a complete elementary/probabilistic resolution: \(F(x)\sim\log x\), with refined bounds \(\log x-O(\sqrt{\log x\log\log x})\le F(x)\le\log x+O(1)\). The upper follows from averaging covered multiplicity and \(\sum_{n\le x}1/n\); the lower combines independent random residue choices among \(n\le x/2\), concentration on the covered counts, and assignment of larger moduli to cover exceptional points. The exact concentration/greedy allocation step needs primary proof verification before GCL certifies the stated \(O\)‑term; a heuristic expectation by itself is not a proof of simultaneous coverage for every \(m\).
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
Independently reconstruct the random assignment proof, checking concentration without erroneous independence across target integers, the exceptional count and the capacity of moduli \(n>x/2\) to repair every exception many times. Source-check Er80,p.108 and confirm whether the refined \(\sqrt{\log x\log\log x}\) error is published or a maintained-site proof sketch.
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/1205 ; [Er80,p.108], related prime-restricted #689.
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: #2476 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
- 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.