Erdős Problem #1139
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
How large can the gaps become between integers with at most two prime factors?
Erdős Problem #1139 writes the eligible integers in increasing order as \(u_1<u_2<\cdots\) and asks whether
The denominator uses the sequence index \(k\), not the integer \(u_k\).
The source phrase “at most two prime factors” requires clarification: does it count factors with multiplicity or only distinct prime divisors?
A small example
In number theory, \(\Omega(n)\) counts factors with multiplicity, while \(\omega(n)\) counts distinct prime divisors.
For example, \(8=2^3\) has
Thus \(8\) is excluded by \(\Omega(n)\le2\) but included by \(\omega(n)\le2\).
Exact factorization through 10,000 gives 3,855 integers with at most two prime factors counted with multiplicity and 5,378 with at most two distinct prime divisors. For the first interpretation the largest observed neighboring gap is \(10\). These differences matter for the statement itself, and no finite search establishes the infinite limsup.
What is known
The maintained catalogue, citing Vardi (1999), lists the conjecture as open. Comments note the lack of a source-verified nontrivial lower bound of the kind needed.
The semiprime sequence, usually associated with \(\Omega(n)=2\), has its own sieve-theoretic gap behavior. Including all prime powers through the weaker \(\omega(n)\le2\) condition would produce a different problem.
GCL's current state
Authenticated source return #2410 explicitly identifies the \(\Omega\) versus \(\omega\) ambiguity and computes both bounded sequences independently.
What remains
Read Vardi's original wording and any referenced almost-prime literature to establish the intended counting convention. Only then investigate rigorously indexed consecutive gaps and possible lower bounds.
Sources and claim boundaries
Erdős #1139; Vardi (1999), Problem 1.4; GCL return. Finite factorizations are independently verified. Open; statement convention pending; unaccepted draft.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2410 — 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.