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 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 statement2 of 5

Let vl(n)=max⁡k≥lv(n,k)v_l(n) = \max_{k\geq l} v(n,k). For every fixed ll, vl(n)→∞v_l(n) \to \infty as n→∞n \to \infty

[ErSe67] Erdős, P. and Selfridge, J. L., Some problems on the prime factors of consecutive integers. Illinois J. Math. (1967), 428--430.

FormalConjectures/ErdosProblems/889.leanErdos889.erdos_889.variants.general1 lineExact file
∀ (l : ℕ), Filter.Tendsto (Erdos889.v_l l) Filter.atTop (nhds ⊤)
OpenStatement only, no proof