Skip to content

Erdős Problem #1184

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 #1184 is OPEN in the maintained catalogue.

For integers \(n,k\) let \(P(m)\) be the largest prime factor and \(f(n,k)=\#\{1\le i\le k:P(n+i)>k\}\). With fixed \(\alpha>1\) and \(n=k^{\alpha+o(1)}\), the conjectured short-interval smooth-number asymptotic is

\[ f(n,k)=(1-\rho(\alpha)+o(1))k, \]

where \(\rho\) is the Dickman function. This is not the usual density of smooth numbers over the entire range \([1,n]\); the interval has only \(k\) points near \(n\).

A small example

Exact prime factorization on short intervals gives large-prime-factor counts: \((n,k)=(100,10)\) yields 8; \((1000,20)\) yields 16; \((10000,40)\) yields 36. The corresponding smooth counts are 2, 4 and 4. These are bounded and do not certify any limiting formula for \(\rho(\alpha)\).

What is known

https://www.erdosproblems.com/1184 remains OPEN, citing Erdős [Er76e,p.272]. His lower bound when \(n>k^\alpha-k\) is \(f(n,k)>(1-1/\alpha+c_\alpha)k\) for \(k\) large, and a separate upper bound \((\alpha-1+o(1))k\) for \(1<\alpha<2\) and \(n\le k^\alpha-k\). Ramachandra–Shorey–Tijdeman [RST75b] establish \(f(n,k)\ge k-\pi(k)\) only when \(n>\exp(c(\log k)^2)\). None supplies the claimed Dickman asymptotic.

GCL's current state

Authenticated original issue research return records an exact statement audit, primary-source references and the bounded mathematical evidence. GCL independently replayed only ci/erdos_compendium_007_phase22_checks.py; it did not certify all original external proofs or resolve open problems. The current manuscript is UNACCEPTED.

What remains

Read Er76e and RST75b primary hypotheses, source-lock the quantifier \(n=k^{\alpha+o(1)}\) and restrictions on \(k\), and derive the precise uniform short-interval Dickman estimates that would be needed for a proof.

Protected admission separately requires source fidelity and the predetermined independent critical-review gate. Finite verification does not satisfy that gate.

Sources and claim boundaries

https://www.erdosproblems.com/1184 ; [Er76e,p.272],[RST75b].

Persisted deterministic finite-check evidence is in governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE22.json. Original source issue body SHA unchanged; no public deployment, V2 approval or kernel certificate claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2455 — 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