Skip to content

Erdős Problem #679

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 a positive integer \(r\), let \(\omega(r)\) count its distinct prime factors. Erdős Problem #679 asks whether, for each \(\varepsilon>0\), infinitely many choices of \(n\) make \(\omega(n-k)\) uniformly small for every sufficiently large \(k<n\): \(\omega(n-k)<(1+\varepsilon)\log k/\log\log k\). The cutoff for 'sufficiently large' depends on \(\varepsilon\), not separately on \(n\). The maintained question remains OPEN.

A small example

For \(n=31\), the choice \(k=1\) gives \(n-k=30=2\cdot3\cdot5\), so \(\omega(30)=3\). With \(k=7\), one has \(n-k=24=2^3\cdot3\), hence \(\omega(24)=2\) while \(\Omega(24)=4\) when prime factors are counted with multiplicity. These finite factorizations illustrate the two functions, but they say nothing about the required all-large \(k\) asymptotics.

What is known

A related, stronger demand replaces the bound by \(\log k/\log\log k+O(1)\). The maintained discussion reports a refutation using a primorial \(Q_m=2\cdot3\cdots p_m\) just below \(n\) and \(k=n-Q_m\), for which \(\omega(n-k)=m\). Its quantitative comparison relies on prime-number-theorem asymptotics, and the complete historical proof is not internally source-locked. This refutes the additive-constant strengthening, not the original \(1+\varepsilon\) bound. A primary 2026 article by Cheuk Fung Lau proves that infinitely many integers have prime-factor counts bounded by a constant times \(\log k\) over relevant shifts. A \(C\log k\) upper bound is substantially weaker than \(\log k/\log\log k\); it does not resolve #679. Lau also discusses a conjectural mechanism pointing toward a negative answer, not an established proof.

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: Primorial construction refutes only the additive-O(1) strengthening; the original relative-epsilon prime-factor assertion stays 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

Verify the full primorial argument's second-order asymptotic and Lau's exact direction of shifts and theorem quantifiers. A bounded successor can prove precisely that the additive \(O(1)\) conjecture fails, while documenting why this does not exclude the relative \(1+\varepsilon\) question. Editorial critical review, protected publication, public MathJax verification and separate V2 admission remain outstanding.

Sources and claim boundaries

Erdős #679 maintained statement; Lau, On the Number of Prime Factors of Consecutive Integers, primary abstract; original-issue authenticated source audit. Original [Er79d] and entire Lau proof not inspected. No novel theorem, independent mathematical certification, protected merge, deployed rendering or editorial admission.

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: #1950 — 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