Skip to content

Erdős problem 889

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

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/889.lean

Formal Conjectures

FormalConjectures/ErdosProblems/889.leanErdos889.erdos_8891 lineExact file
Filter.Tendsto Erdos889.vFilter.atTop (nhds ⊤)
OpenStatement only, no proof

Continue

Search problems.science

Find a Problem, Result, source, or page