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 0i<k0\leq i < k. Is it true that v0(n)=maxk0v(n,k)v_0(n)=\max_{k\geq 0}v(n,k)\to \infty as nn\to \infty?
Retained from Formal Conjectures · not edited here
Formal statements
4 open · 1 solved
Erdős Problems says
open
Decision here
No current contribution
Checks
0 checks · 5 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page