原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
f all of the nj’s other than ni: mi = n1n2 ⋯ ni−1ni+1 ⋯ nk. We next define for i = 1, 2, …
, k. Equation (31.31) is well defined: since mi and ni are relatively prime (by Theorem 31.6), Corollary 31.26 guarantees that mod ni exists. Here is how to compute a as a function of the ai and ci: We now
show that equation (31.32) ensures that a = ai (mod ni) for i = 1, 2, …, k. If j ≠ i, the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea