Erdős problem 889

Let $v(n,k)$ count the prime factors of $n+k$ which do not divide $n+i$ for $0\leq i < k$ . Is it true that $v_0(n)=\max_{k\geq 0}v(n,k)\to \infty$ as $n\to \infty$ ?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

FormalConjectures/ErdosProblems/889.lean

Formal Conjectures

FormalConjectures/ErdosProblems/889.leanErdos889.erdos_8891 lineExact file

1Filter.Tendsto Erdos889.v₀ Filter.atTop (nhds ⊤)

OpenStatement only, no proof