Erdős Problem #205
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: disproved (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
Can every sufficiently large positive integer \(n\) be written as
where \(\Omega(m)\) counts prime factors with multiplicity? Erdős thought the answer should be yes, even though representing a number as a power of two plus a prime is already known to fail on a positive-density set.
Using the multiplicity-sensitive function \(\Omega\), rather than the number of distinct prime factors, matters. The natural logarithms and the strict inequality are also material.
A small example
For \(m=12=2^2\cdot3\), \(\Omega(m)=3\), whereas the number of its distinct prime divisors is two. A proposed decomposition \(n=2^k+m\) must check the numerical value of \(\log\log m\), not merely whether \(m\) looks smooth or has few distinct divisors.
The case \(m=1\) requires an explicit convention since \(\log\log1\) is undefined; it is excluded from the formula above. In studying counterexamples, all powers \(2^k<n\) must be tested, not just \(k\) near \(\log_2 n\).
What is known
DISPROVED for the unrestricted question. The maintained Erdős #205 reports a construction by Kevin Barreto and Leeham using ChatGPT and Aristotle, with further quantitative analysis by Terence Tao and Boris Alexeev, that produces infinitely many integers \(n\) for which every positive remainder \(n-2^k\) has at least
prime factors counted with multiplicity. This eventually exceeds \(\log\log(n-2^k)\) when the remainder is at most \(n\) (with the small-remainder convention handled separately), thereby contradicting the asserted universal decomposition.
The constructed integers are divisible by large powers of two. A separate residual question remains open: are there arbitrarily large odd counterexamples? Romanoff's 1934 theorem gives positive density for primes-plus-powers-of-two representations, but does not establish a representation of every sufficiently large integer.
This is an externally reported AI-assisted mathematical solution, not a new GCL proof. Neither its full construction nor its external Aristotle formalization has been replayed at a pinned source and toolchain here.
GCL's current state
Pinned and maintained status: DISPROVED; original issue #1474. The pinned provider has no admitted statement for #205; the published problem's multiplicity convention and odd-variant boundary must be captured before formal reuse.
The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.
What remains
A bounded task computes \(\Omega(m)\) by exact trial division, enumerates powers \(2^k<n\) for a sample of numbers, and records the minimum observed remainder complexity with the strict logarithmic threshold. Acceptance: distinguish primes counted with multiplicity from distinct primes, preserve the exclusion of undefined logarithms, and label all finite evidence noncertifying. Proof replay must isolate the infinite construction and demonstrate each uniform lower bound.
Sources and claim boundaries
- Erdős #205, Er80, Romanoff 1934, Barreto–Leeham and Tao–Alexeev source notes.
- GCL original issue #1474.
No independently GCL-proved counterexample family, resolution of the odd case or editorial admission is claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1474 — 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.