proven
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
-
no assumptions
thm✓Lax59.Nagura
Theorem
For every natural number , there is a prime natural number strictly between and . The inequality is encoded without division as .
Lean source view on GitHub
| 1 | import Mathlib |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Nagura's Prime Interval Theorem |
| 6 | type: theorem |
| 7 | --- |
| 8 | For every natural number , there is a prime natural number |
| 9 | strictly between and . The inequality is encoded without division as |
| 10 | . |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax59.Nagura |
| 14 | |
| 15 | /-- The natural-number form of Nagura's prime-interval property. -/ |
| 16 | def NaguraBound : Prop := |
| 17 | ∀ x : ℕ, 25 ≤ x → ∃ r : ℕ, r.Prime ∧ x < r ∧ 5 * r < 6 * x |
| 18 | |
| 19 | /-- Nagura's theorem in the natural-number form used by this submission. -/ |
| 20 | axiom nagura_bound : NaguraBound |
| 21 | |
| 22 | end Lax59.Nagura |
| 23 |
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments