smallest Euler brick is (44,117,240)
Theorem.smallest Euler brick is (44,117,240) — (44, 117, 240): all three face diagonals integral, minimal by exhaustion.
Proof.exhaustive bounded search — all three face diagonals integral, minimality by exhaustion; the perfect cuboid stays OPEN.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/thunder/verify/index.ts#discoveredTheoremsWaveEight
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"smallest Euler brick is (44,117,240)" 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 discoveredTheoremsWaveEight.
- 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 (discoveredTheoremsWaveEight @ 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 discoveredTheoremsWaveEight (src/thunder/verify/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.