Erdős Problem #1139 — Unbounded Gaps Between Almost-Primes
For a positive integer , let be the number of its prime factors counted with multiplicity, with . Enumerate the positive integers satisfying in increasing order as . The question is whether
In other words, are the gaps between consecutive integers with at most two prime factors unbounded relative to the logarithm of their index? Erdős Problems #1139 (Va99, 1.4)
Background
The problem is recorded as Va99, 1.4. A related line of work studies the occurrence of primes in short intervals and residue classes. Replacing primes by integers with at most two prime factors is described as a weakening of that problem; these integers are called almost primes in that work. Erdős Problems #1139 (Va99, 1.4) arXiv:2307.14890
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.