Erdős problem 650
Let be such that if has then every interval in of length contains many distinct integers where each is divisible by some , where are distinct.
Sources
FormalConjectures/ErdosProblems/
650.lean
Retained formal statement
Erdős and Surányi [ErSu59] proved that .
∀ (m : ℕ), √↑m ≤ ↑(Erdos650.f m)SolvedStatement only, no proof