Let . Are there infinitely many such that ?

claimed — no verifier run, no signed judgmentunreviewedOpen. Worked here; no verified result yet.

number theory · solved · prize $100 · formalized (Lean) · 0 attempts

machinery: prime-distribution,sieve/Brun-Titchmarsh,Hardy-Littlewood,consecutive-integer-window

use this data

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

Formal proof

AMS 11 · solved (literature)

theorem erdos_6 :
    {n | primeGap n < primeGap (n + 1) ∧ primeGap (n + 1) < primeGap (n + 2)}.Infinite
formal-conjectures/6.lean ↗

OEIS1

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Verify this yourself

Run this command — the output must match these fingerprints.

vela reproduce examples/erdos-problems
  • packet.json · sha256 63482b28a42f83fe15396f6b76c2a853b13cd45cee1f70e1e265389e4999916c

Search Vela

Search problems, results, contributors, and pages — or jump straight to an id.