Erdős problem 889 · problems.science

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$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

5 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

889.lean

Retained formal statement1 of 5

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$ ?

FormalConjectures/ErdosProblems/889.leanErdos889.erdos_8891 lineExact file

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

OpenStatement only, no proof

Sources

Search problems.science