Claims

../

2026_01_11_dottedcalculator: For every constant C, every large n has some k below n with omega(n-k) at least log k over log log k plus C, so the version with an O(1) error term is false; a thread post credited in the site's remarks, with a Lean proof.

2026_04_16_lau: Under a conjecture on short intervals containing integers with many prime factors, every large n has some large k below n with omega(n-k) above (1+delta) log k over log log k, so the first question would have answer no.

---