{"schema":"vela.problem-packet.v0.1","problem":889,"statement":"For $k\\geq 0$ and $n\\geq 1$ let $v(n,k)$ count the prime factors of $n+k$ which do not divide $n+i$ for $0\\leq i<k$. Equivalently, $v(n,k)$ counts the number of prime factors of $n+k$ which are $>k$.Is it true that\\[v_0(n)=\\max_{k\\geq 0}v(n,k)\\to \\infty\\]as $n\\to \\infty$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}