Skip to content

Erdős Problem #851

Editorial depth: Reviewed explanatory article — evidence qualified.
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.

The question in plain language

Romanoff proved that powers of two plus primes cover a set of positive density. The stronger problem allows boundedly-many prime factors and asks for density arbitrarily close to one. A solved status is reported, but the model-assisted proof needs independent source review.

For every epsilon>0, does there exist a finite r=r(epsilon) such that integers of the form 2^k+n (k>=0, positive n with at most r prime factors) have LOWER NATURAL DENSITY at least 1-epsilon? The count of prime factors must specify distinct omega(n) versus multiplicity Omega(n), and limiting density/lower density convention must be source-locked.

A small example

Finite integers 10=2^0+9=1+3² (nine has one distinct prime factor but two with multiplicity), and 10=2^3+2 (one factor). Thus the classification of near-primes differs for omega and Omega and k may equal zero. Enumerating small targets cannot certify density arbitrarily close to one.

This finite calculation tests definitions, not a result quantified over all large N or infinite sets.

What is known

Maintained https://www.erdosproblems.com/latex/851 read 2026-10-14 reports YES by Price using GPT-5.2 Pro in the comments, as opposed to Romanoff [Ro34] positive density for prime n (r=1). Sawhney and Green reportedly claim a quantitative version r<<log(1/epsilon)/loglog(1/epsilon), but that appears in comments, not a fully reviewed published theorem in current audit. The entire external proof, its constants, denominator for small epsilon and meanings of 'prime divisors', and whether the bound is really valid for epsilon tending to zero remain pending independent source review.

A prime factor count can mean either the number of distinct prime factors, conventionally omega, or the count WITH multiplicities, conventionally Omega. For example nine has omega(9)=1 and Omega(9)=2. Exact example ten can be written as 2^0+9 or 2^3+2. Without checking which convention Price's source proof uses, one cannot turn a finite membership example into the global density theorem. The asserted quantitative dependence on epsilon from Sawhney and Green remains a source-comment claim pending primary proof verification.

GCL's current state

The original authenticated RESULT/1 source return has historical disposition STATUS_CONFLICT. 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: Price's GPT-assisted density theorem is externally reported, not GCL proof-replayed; distinguish omega versus Omega prime-factor counting and quantitative comments.

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

Retrieve and independently review Price's full proof return and Sawhney–Green argument. Implement omega versus Omega counterexample on n=9 and explicit small 2^k+n memberships. Do not claim formal proof or independent critical acceptance solely from model-assisted source comments.

Before acceptance, independently verify source theorem hypotheses and proof fidelity, check displayed mathematics in a deployed browser, and submit a protected editorial admission. A deployed explanatory draft exists. The distinct V2 admission and the model-assisted proof verification remain pending.

Sources and claim boundaries

  • Erdős problem #851 and maintained LaTeX/bibliography, read 14 October 2026.
  • Authenticated source-audit return, including mathematical scope and outstanding primary-paper obligations.
  • Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml; external proof claims not independently certified by GCL.
  • Critical review: PENDING. Protected publication: NOT MERGED. Deployed MathJax: NOT VERIFIED. Formal theorem replay: NONE.

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: #2122 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • 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