知识卡片
中国剩余定理拆分互素模运算
当n是两两互素模数nᵢ的乘积时,模n的一个剩余类与各模nᵢ的余数组成的元组一一对应。加法和乘法可在每个坐标独立完成;互素条件使拆分与重建都唯一。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
, k. Then, mapping (31.27) is a one-to-one mapping (bijection) between ℤn and the Cartesian product . Operations performed on the elements of ℤn can be equivalently performed on the corresponding k-tuples by performing the operations
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[45000,50000))。
- 结论依据:原文对中国剩余定理、模幂性质或重复平方法给出定理与算法;公式图已核对。
- 原始内容:Theorem 31.27 (Chinese remainder theorem) Let n = n 1 n 2 ⋯ n k , where the n i are pairwise relatively prime. Consider the correspondence where , and a i = a mod n i for i = 1, 2, …, k . Then, mapping (31.27) is a one-to-one mapping (bijection) between ℤ n and the Cartesian product . Operations performed on the elements of ℤ n can be equivalently performed on the corresponding k -tuples by performing the operations