Skip to content

Erdős problem 4

Is it true that, for any C>0C > 0, there infinitely many nn such that: pn+1pn>Cloglognloglogloglogn(logloglogn)2logn p_{n + 1} - p_n > C \frac{\log\log n\log\log\log\log n}{(\log\log\log n) ^ 2}\log n

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

Search problems.science

Find a Problem, Result, source, or page