Try Notedeck free · More Cryptography demos
← Notedeck 密码学 · Chinese Remainder Theorem · reconstruct x Try in Notedeck

Chinese Remainder Theorem · reconstruct x — interactive Cryptography demo

Solve x ≡ rᵢ (mod mᵢ) for pairwise-coprime moduli; the solution is unique mod M = ∏mᵢ

Run this interactive Cryptography demo live below, or download it as a single self-contained HTML file that works offline in any browser or LMS — one of 1,900+ free interactive teaching demos on Notedeck. With Notedeck you upload your own materials and turn them into interactive courseware, question papers with answer keys, and AI-taught lessons.