Chinese Remainder Theorem
Theorem.Chinese Remainder Theorem — pairwise-coprime moduli give a UNIQUE solution mod Π m_i, constructed via modular inverses and.
Proof.pairwise-coprime moduli give a UNIQUE solution mod Π m_i, constructed via modular inverses and verified to reconstruct every residue class for three moduli sets — the isomorphism ℤ/Π ≅ ∏ ℤ/m_i.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/9/1/index.ts#discoveredTheoremsWaveThirty
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
"Chinese Remainder Theorem" 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 discoveredTheoremsWaveThirty.
- 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 (discoveredTheoremsWaveThirty @ src/9/1) 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 discoveredTheoremsWaveThirty (src/9/1/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.