Erdős Problem #1058
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: proved (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
Write the primes in increasing order, \(p_1=2,p_2=3,p_3=5,\ldots\). Choose an integer \(n\) between two consecutive primes,
and inspect the prime factors of \(n!+1\). Could it happen infinitely often that all these prime factors belong to the very short list \(\{p_k,p_{k+1}\}\)?
The Erdős–Stewart question, Erdős Problem #1058, asks whether only finitely many such \(n\) exist. A permitted prime need not actually occur: equivalently one allows
A small example
For the first few integers,
These factorizations were independently verified. For \(n=2,3,4,5\), each \(n!+1\) uses only the two primes allowed by the relevant consecutive-prime interval. The \(n=1\) entry requires an explicit indexing convention, such as \(p_0=1\), because the usual prime sequence starts at \(p_1=2\). A rigorous statement must not silently overlook that endpoint.
What is known
The question is solved in the affirmative. Florian Luca's paper On a Conjecture of Erdős and Stewart, Mathematics of Computation 70 (2001), 893–896, proves that there are no solutions with \(n\ge6\) under the stated adjacent-prime-factor restrictions. The main result is stated on printed page 893.
The proof uses more than elementary factorization. It includes constraints from valuations and lower bounds for linear forms, together with finite computational exclusions. The existence and scope of the published result are documented; GCL has not independently replayed its difficult analytic or computational components.
GCL's current state
The authenticated source audit #2329 identifies Luca's published resolution and the exact meaning of the nonnegative exponents. It verifies the small cases and flags the \(n=1\) indexing convention as a source-fidelity detail.
The pinned GCL catalogue already labels the problem proved. There is no frozen admitted GCL formal-provider statement for this numbered entry in the cited provider snapshot, and no independently certified GCL Lean proof is being claimed.
What remains
The mathematical question has an externally published solution. The remaining GCL obligations are documentary: compare Luca's theorem and Guy's original problem A2 with exact page references, settle the harmless but necessary \(n=1\) convention, and distinguish the published proof from computations and arguments independently reproduced by GCL. Any later formalization should preserve both the allowed-prime quantifiers and nonnegative exponents.
Sources and claim boundaries
- Erdős Problem #1058, statement and published-resolution summary.
- Florian Luca (2001), publisher DOI, On a Conjecture of Erdős and Stewart, printed pp. 893–896.
- Richard K. Guy, Unsolved Problems in Number Theory (2004), problem A2; exact primary edition comparison outstanding.
- Authenticated GCL audit #2329, partial source-fidelity research, not independent proof certification or protected editorial admission.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2329 — 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.