If $\omega(n)$ counts the number of distinct prime divisors of $n$ then let

$$F(n)=\max_k \omega(n+k)\frac{\log\log k}{\log k}.$$

Prove that $F(n)\to \infty$ as $n\to \infty$.