Skip to content

Erdős problem 463

Is there a function ff with f(n)f(n)\to\infty as nn\to\infty such that, for all large nn, there is a composite number mm such that n+f(n)<m<n+p(m) n + f(n) < m < n + p(m) Here p(m)p(m) is the least prime factor of mm.

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#463
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page