Erdős Problem #663
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
Erdős Problem #663 asks for the least prime missing from a product of consecutive integers. Let \(P(n,k)=\prod_{i=1}^k(n+i)\) and let \(q(n,k)\) be the smallest prime not dividing \(P(n,k)\). For each fixed integer \(k\geq2\), is \(q(n,k)\leq(1+o(1))\log n\)? The catalogue says OPEN. The established elementary bound has \(k\) instead of 1.
A small example
For \(n=20\), \(k=2\), the product \(21\cdot22=462\) has factors 2, 3, 7 and 11. The first missing prime is 5. For \(n=209\), the factor \(n+1=210\) ensures all primes through 7 divide the product, so the missing prime is at least 11.
What is known
If every prime \(p\leq y\) divides \(P(n,k)\) then their product does too. Taking logs gives \(\vartheta(y)\leq k\log n+O_k(1)\). By the prime number theorem, \(\vartheta(y)\sim y\), which gives \(q(n,k)\leq(k+o(1))\log n\). For a lower example put \(n=M-1\) with \(M\) the product of all primes through \(y\). Then every such prime divides \(n+1\), so \(q(n,k)>y\) and \(\log n\sim y\). Thus coefficient one would be sharp.
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: Primorials certify a leading coefficient lower mechanism; fixed-k conjectured upper improvement remains open.
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
For \(k=2\) prove a sharp lower estimate for \(n\) when \(n\) is congruent to -1 or -2 modulo every prime between 3 and \(y\). Also inspect the original Erdős sources. A finite residue search cannot prove the required asymptotic statement.
Sources and claim boundaries
Maintained statement, original issue, and the classical prime number theorem. Historical [Er97e] and [BEGL96] pages remain uninspected. This article is an editorially reviewed with source exception: no novel theorem, protected merge, deployed mathematics inspection, or editorial admission is claimed.
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: #1934 — 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.