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?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#889
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page