Bertrand postulate to 10⁴
Theorem.Bertrand postulate to 10⁴ — a prime with n < p ≤ 2n.
Proof.a prime with n < p ≤ 2n for every n ≤ 10⁴ by one sieve — Chebyshev cited for all n.
Checked by exact arithmetic over the stated finite range — a verified witness, evidence toward the claim, not a ∀-proof.
src/thunder/verify/index.ts#discoveredTheoremsWaveFourteen
1 · Classification
bounded-witness — computed witness within a cited frame (the unbounded form leans on the cited literature)
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"Bertrand postulate to 10⁴" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation discoveredTheoremsWaveFourteen.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (discoveredTheoremsWaveFourteen @ src/thunder/verify) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes discoveredTheoremsWaveFourteen (src/thunder/verify/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.