Erdős Problem #688
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
Define ε_n as the supremum of exponents ε for which one can choose one residue class a_p modulo each prime with n^ε<p≤n and cover all integers 1,…,n. Erdős asks if ε_n→0. The interval of available prime moduli shrinks as ε grows; so the claim is that every successful covering must eventually employ very small primes relative to n. The maintained status is OPEN.
A small example
For n=10, excluding p=2 leaves 3,5,7. Their chosen classes meet at most 4+2+2=8 elements of 1,…,10, so those primes alone cannot cover the interval. In fact an exhaustive enumeration of all 2·3·5·7=210 residue choices shows that even the FULL set of primes 2,3,5,7 cannot cover the first ten integers. Consequently there is no feasible ε at n=10, and a finite-n definition as a maximum over successful choices is undefined here. The formal supremum-of-empty-set convention requires its own explanation. This is not evidence for or against ε_n→0 when n is sufficiently large.
What is known
The maintained source attributes the lower estimate ε_n ≫ logloglog n / loglog n to Erdős. It does not settle the requested upper decay. Direct inspection of the pinned FormalConjectures/ErdosProblems/688.lean (commit 85f8637..., blob d7d04f26c5b2f47c0023013fe4d961fc93062a1b) shows a predicate requiring, for every m∈[1,n], some prime p with n^ε<p≤n and matching residue; epsilonFunction is the supremum of such ε. All displayed theorem bodies, including the classical attributed lower-bound variant, contain sorry, so the snapshot is not a proof certificate. A supremum need not be attained, and its defining set can be empty at small n; treating it as a finite maximum for every n requires justification.
GCL's current state
The original authenticated RESULT/1 source return records BOUNDED_TASK_DESIGNED and retains the original mathematical qualifications. This is an editorially reviewed explanatory article in the EC-BULK-005-R9 protected batch, effective only when that exact-hash transaction merges. The corresponding maintained Erdős statement and its bibliography were inspected. This editorial decision does not certify any full original theorem proof, independent external formalization, or Lean kernel check.
Preserved source-review qualifications: epsilon n supremum domain empty small n; pinned fc sorry; epsilon n o1 open. See the immutable 128-case critical review record for the complete source-return caveats.
What remains
Normalize strict threshold and supremum carefully; prove a finite upper bound using counting residues, then determine which assumptions permit passage to asymptotic ε_n. Acceptance requires an explicit theorem on n, prime cutoffs, and coverage, or a well-specified source blocker. The original Erdős [Er80,p.106] proof of the lower estimate still requires primary-page inspection.
Sources and claim boundaries
Sources: maintained Erdős #688; https://www.erdosproblems.com/688 ; https://github.com/google-deepmind/formal-conjectures/blob/85f863718beeec7b58a3a1926ee92e3472bc2020/FormalConjectures/ErdosProblems/688.lean ; historical [Er80,p.106]. GCL original source return. Historical references not independently inspected. No theorem novelty, protected merge, full browser rendering or V2 admission.
Editorial source decision: R9 critical review, REVIEWED as a source-grounded explanation only. All open mathematical questions, primary-proof fidelity obligations, and external formalization caveats remain separate.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1959 — 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.