Erdős problem 218 · problems.science

There are infinitely many indices $n$ such that the prime gap at $n$ is equal to the prime gap at $n+1$ . This is equivalent to the existence of infinitely many arithmetic progressions of length $3$ , see erdos_141.variants.infinite_three.

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/218.lean

Formal Conjectures

FormalConjectures/ErdosProblems/218.leanErdos218.erdos_218.variants.ge1 lineExact file

1{n | primeGap (n + 1) ≤ primeGap n}.HasDensity (1 / 2)

OpenStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI alongside literature
Erdős AI contributions wiki · 28 Jan, 2026
Machine
GPT
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Reported activity

Continue

Search problems.science