原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
se relatively prime. Consider the correspondence where , and ai = a mod ni 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
independently in each coordinate position in the appropriate system. That is, if a ↔ (a1,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea