Skip to content

Erdős Problem #1201

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, primes.

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 #1201 has maintained status OPEN at this audit.

Write \(P(m)\) for the largest prime divisor of \(m>1\). Fix \(\epsilon,\eta>0\) and ask whether a fixed integer block length \(k=k(\epsilon,\eta)\), independent of \(n\), exists so that the lower natural density of positive integers \(n\) satisfying

\[ P\bigl(n(n+1)\cdots(n+k)\bigr)>n^{1-\epsilon} \]

is at least \(1-\eta\). There are \(k+1\) consecutive factors, not \(k\), under the displayed convention. The natural density may require a liminf; a finite-count ratio is not a limiting density. Small positive \(n\) and exponent \(\epsilon\ge1\) are degenerate and should not replace the nontrivial \(0<\epsilon<1\) regime.

A small example

The phase24 integer-factorization fixture samples \(2\le n\le30,100,300\) and \(k=0,2,5\) with \(\epsilon=2/5\); for \(N=30\), successes are 25 of 29 for \(k=0\) and 29 of 29 for \(k=2\) or \(5\). Here the largest factor of the product is computed directly and compared against \(n^{3/5}\). These bounded frequencies are not a natural-density assertion, and cannot support a claim valid for every \(\epsilon,\eta>0\).

What is known

The catalogue https://www.erdosproblems.com/1201 labels it OPEN, Erdős [Er80,p.107], and records Erdős's partial case \(\epsilon=1/2\). That is not a proof for arbitrarily small positive \(\epsilon\) and arbitrary \(\eta\). Current site has comments but no reviewed external theorem in the captured maintained statement. Proof of a high-density large-prime factor along even a short block requires careful sieve and shifted-smooth-number estimates; a bound for a single factor is not automatically uniform in the fixed short block.

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

Read Er80,p.107 and check the exactly‑\(k\) versus \(k+1\) indexing. Source-review the known \(\epsilon=1/2\) proof, and seek a rigorous decomposition of the bad set where every shifted factor is \(n^{1-\epsilon}\)‑smooth, with bounds uniform in \(n\) for a fixed \(k\). Preserve density liminf/limit and quantifier order.

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/1201 ; [Er80,p.107].

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: #2472 — 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.

Back to catalogue · Compendium introduction