Let $ω (n)$ count the number of distinct prime factors of $n$ . What is the size of the largest interval $I \subseteq [x, 2 x]$ such that $ω (n) > lo g lo g n$ for all $n \in I$ ?

Worked, still open.

number theory · open · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

[ L(x):=\max\\{|I|:\ I\subseteq [x,2x]\text{ is an interval and }\omega(n)>\log\log n\ \forall n\in I\\}. ]

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

open