Skip to content

Erdős Problem #687

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 x≥2, choose a single residue class modulo every prime p≤x. Let Y(x) be the largest y for which every integer 1,…,y is in at least one chosen class. How large can Y(x) be? Erdős asked for Y(x)=o(x²) or even x^(1+o(1)); neither upper improvement is established in the maintained source. The choice of residues may depend on x; this is not a single fixed system covering all positive integers.

A small example

When x=3, the primes are 2 and 3. The choices 1 modulo 2 and 2 modulo 3 cover 1,2,3, giving Y(3)≥3. No choice can cover the first four: if the modulo-2 class is even, the remaining odd points 1 and 3 are different modulo 3; if it is odd, the remaining 2 and 4 are different modulo 3. Thus Y(3)=3. This finite calculation is not an asymptotic bound.

What is known

The maintained Erdős catalogue attributes Y(x) ≪ x² to Iwaniec [Iw78] and a lower bound Y(x) ≫ x·log x·logloglog x/loglog x to Ford, Green, Konyagin, Maynard and Tao [FGKMT18], with constants and asymptotic ranges dependent on their original theorems. Those original papers and the exact Jacobsthal equivalence have not been independently re-read in this tranche. The finite expectation of residue coverage is not enough to prove maximal interval coverage; it is a highly structured covering-sieve problem. A prize quoted by the historical source is not evidence of a solution or an award.

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: yx o x2 unknown; iwaniec fgkmt prior result primary not read. See the immutable 128-case critical review record for the complete source-return caveats.

What remains

Read Iwaniec's original theorem and the FGKMT prime-gap construction, then state the exact connection between Y(x) and the Jacobsthal function of the primorial Π_{p≤x}p, with constants. Prove one bounded implication, or produce a precise equivalence-condition failure, and validate it with finite x=3 and x=5 searches. Do not import prime-gap theorems without their hypotheses.

Sources and claim boundaries

Sources: maintained Erdős #687; https://www.erdosproblems.com/687 ; source [Er79d,p.79],[Er80,p.106],[Er96b]; primary [Iw78],[FGKMT18] not independently inspected. 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: #1958 — 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.

Back to catalogue · Compendium introduction