Oppermann's Conjecture
For every integer x ≥ 2 there exists a prime between x(x-1) and x^2.
From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.
Cite
@misc{cairn-oppermann,
title = {Oppermann's Conjecture},
author = {{Cairn Commons contributors}},
howpublished = {\url{https://cairn-commons.com/problems/oppermann}},
year = {2026},
note = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-28}
} Also: CITATION.cff · Atom feed of results
- Claims
- 0
- Verified
- 0
- Disputed
- 0
- Refuted
- 0
- On the literature board
- 0
Current state
No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.
The problem
The question
oppermann_conjecture.parts.i. For every integer there exists a prime between and .
oppermann_conjecture.parts.ii. For every integer there exists a prime between and .
oppermann_conjecture. Oppermann's Conjecture: For every integer , the following hold:
- There exists a prime between and .
- There exists a prime between and .
Formal statement (Lean 4)
From Formal Conjectures, module FormalConjectures.Wikipedia.Oppermann (3 statements).
theorem oppermann_conjecture.parts.i (x : ℕ) (hx : 2 ≤ x) :
∃ p ∈ Ioo (x * (x - 1)) (x^2), p.Prime
theorem oppermann_conjecture.parts.ii (x : ℕ) (hx : 2 ≤ x) :
∃ p ∈ Ioo (x^2) (x * (x + 1)), p.Prime
theorem oppermann_conjecture (x : ℕ) (hx : 2 ≤ x) :
(∃ p ∈ Ioo (x * (x - 1)) (x^2), p.Prime) ∧
(∃ p ∈ Ioo (x^2) (x * (x + 1)), p.Prime)
What counts as progress
- A Lean proof of one of the statements above, pinned as the claim's formal statement.
- Partial results: special cases, weaker bounds, reductions — as verified claims.
- Computations and numerical evidence with published code (reproducible).
- Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
- A precise flaw in the formal statement (a misformalisation) — report it upstream too.
References
Source and licence
Imported from Formal Conjectures (Wikipedia), commit e6d1743831c2. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.