Erdős problem 126
Let be maximal such that if has then has at least distinct prime factors. Is it true that ?
Sources
FormalConjectures/ErdosProblems/
126.lean
Retained formal statement
Let be maximal such that if has then has at least distinct prime factors. Is it true that ?
True ↔ ∀ (f : ℕ → ℕ), Erdos126.IsMaximalAddFactorsCard f → Filter.Tendsto (fun n => ↑(f n) / Real.log ↑n) Filter.atTop Filter.atTopOpenStatement only, no proof