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

$v_0(n) > 1$ for all $n$ except $n$ = 0, 1, 2, 3, 4, 7, 8, 16

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

1∀ n ∉ {0, 1, 2, 3, 4, 7, 8, 16}, 1 < Erdos889.v₀ n

SolvedStatement only, no proof

Sources

Search problems.science