Claims

../

2026_04_16_lau: Theorem 1.3 of Lau's 2026 preprint gives infinitely many n with at most C log k prime factors in n minus k for every k, which yields an epsilon with infinitely many n satisfying m + epsilon omega(m) at most n for all m below n.

---