If $ω (n)$ counts the number of distinct prime divisors of $n$ then let $F (n) = k max ω (n + k) \frac{lo g lo g k}{lo g k} .$ Prove that $F (n) \to \infty$ as $n \to \infty$ .

Worked, still open.

number theory · open · possible · formalized (Lean) · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

formal

AMS 11 · open (literature)

theorem erdos_1203 :
    answer(sorry) ↔ Tendsto F atTop atTop

open