Erdős Problem 248

Reference: erdosproblems.com/248

theorem erdos_248 : (∃ C > 0, {n : ℕ | ∀ k ≥ 1, ↑(ArithmeticFunction.cardDistinctFactors (n + k)) ≤ C * ↑k}.Infinite) ↔ sorry

Are there infinitely many $n$ such that, for all $k\geq 1$ $$ \omega(n + k) \ll k? $$ Here $\omega(n)$ is the number of distinct prime divisors of $n$.