Erdős Problem #452 — Let ω(n) count the number of distinct prime factors of n. What is the size of the largest interval I⊆ [x,2x] such that ω(n)>loglog n for all n∈ I?
Statement
Let count the number of distinct prime factors of . What is the size of the largest interval such that for all ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.