prime_gap_record
Provednumber-theory
Maximal prime gaps: For every n, there is a prime p followed by a gap of length ≥ n. The sequence of record prime gaps (largest gaps before p_k) grows. Cramér's conjecture: max gap ≈ (log p)². Open: exact growth rate of maximal prime gaps.
Preamble
import Mathlib
Formal statement
import Mathlib
theorem prime_gap_record :
∀ n : ℕ, ∃ p : ℕ, Nat.Prime p ∧
(∀ q : ℕ, Nat.Prime q → q > p → q > p + n) ∨
∃ q : ℕ, Nat.Prime q ∧ q = p + 1 := by
sorrySource