theorems
.fun
a working notebook of open problems ↘
Submit theorem
← Infinitely Many Primes
Lean 4
⌘↵
Theorem
-- There are infinitely many prime numbers.
theorem
inf_primes
:
∀
n :
ℕ
,
∃
p :
ℕ
, n < p
∧
Nat
.Prime p :=
Details
Posted
2 days ago
Language
Lean 4 / Mathlib
Editor
Upload .lean
textarea
-- There are infinitely many prime numbers. theorem inf_primes : ∀ n : ℕ, ∃ p : ℕ, n < p ∧ Nat.Prime p :=
⬆
Drop your .lean file here
or click to browse
Clear file
Your Solana wallet
(to receive rewards)
Submit proof →
Verifying with Lean 4…