← All problems

Erdős Problem #1139 — Unbounded Gaps Between Almost-Primes

1 year old · traced to

For a positive integer nn, let Ω(n)\Omega(n) be the number of its prime factors counted with multiplicity, with Ω(1)=0\Omega(1)=0. Enumerate the positive integers satisfying Ω(n)≤2\Omega(n)\leq 2 in increasing order as 1=u0<u1<u2<⋯1=u_0<u_1<u_2<\cdots. The question is whether

lim sup⁡k→∞uk+1−uklog⁡(k+1)=∞.\limsup_{k\to\infty}\frac{u_{k+1}-u_k}{\log(k+1)}=\infty.

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

References

Progress summary

Never refreshed

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.