请输入您要查询的字词:

 

单词 Chinese remainder theorem
释义
Chinese remainder theorem

Mathematics
  • For coprime natural numbers m and n, ℤmn is isomorphic to ℤm×ℤn as a ring. More concretely, there is unique x in the range 0 ≤ x < mn that solves the simultaneous congruences x ≡ a (mod m) and x ≡ b (mod n). The isomorphism from ℤmn to ℤm×ℤn sends x mod mn to (x mod m, x mod n). If u,v are integers such that um + vn = 1 (see bézout’s lemma), then the inverse sends (a mod m, b mod n) to vna + umb mod mn.

    More generally, if I and J are coprime ideals of a ring R then

    RI∩J≅RI×RJ.

    This can be proved by applying the first isomorphism theorem to the homomorphism r ↦ (r + I,r + J).


Computer
  • Let

    m1,m2,…,mr
    be positive integers that are relatively prime to one another, and let their product be m:
    m=m1m2…mr
    Let n, u1, u2,…, ur be integers; then there is exactly one integer, u, that satisfies
    n≤u<(m+n)
    and
    u≡uj(modulomj)for1≤j≤r


随便看

 

科学参考收录了60776条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。

 

Copyright © 2000-2023 Sciref.net All Rights Reserved
京ICP备2021023879号 更新时间:2026/9/26 10:10:42