Skip to content

Erdős problem 889

Start work

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

Sources

The source's own material, retained exactly.

5 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

889.lean

Retained formal statement1 of 5

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

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