Problem 452

Erdős Problem #452: declared status 'open'. Formalized: no. Let $\omega(n)$ count the number of distinct prime factors of $n$. What is the size of the largest interval $I\subseteq [x,2x]$ such that $\omega(n)>\log\log n$ for all $n\in I$? Prize: no. Tags: number theory.