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

Sources

Browse retained paths and inspect the exact material available for this Problem.

2 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

4.lean

Retained formal statement1 of 2

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

FormalConjectures/ErdosProblems/4.leanErdos4.erdos_41 lineExact file
True ↔ ∀ C > 0, Erdos4.Erdos4For C
SolvedStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page