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

Does $V_1(n) = 1$ have finite solutions?

This is a modification of erdos_889.variants.v1_eq_1_finite, which might make it more amenable to attack according to [ErSe67].

[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.V1_eq_1_finite1 lineExact file

1True ↔ {n | Erdos889.V_l 1 n = 1}.Finite

OpenStatement only, no proof

Sources

Search problems.science