For every integer
, there exists a prime p such that
namespace OppermannConjecture theorem oppermann (n : ℕ) (h : n > 1) : (∃ p : ℕ, Nat.Prime p ∧ p ∈ Ioo (n^2 - n) (n^2)) ∧ (∃ q : ℕ, Nat.Prime q ∧ q ∈ Ioo (n^2) (n^2 + n)) := by sorry end OppermannConjecture
Opperman's Conjecture states that for any integer n > 1, there exists one prime number between and another between