原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
e definition of multiplication modulo n, we define the multiplicative group modulo n as .
The elements of this group are the set of elements in ℤn that are relatively prime to n, so that each one has a unique inverse, modulo n: To see that is well defined, note that for 0 ≤ a < n, we have a = (a + kn) (mod n) for all integers k. By Exercise 31.2-3, therefore, gcd(a, n) = 1 implies gcd(a + kn, n) = 1 for all integers k. Since [a]
n = {a + kn : k ∈ ℤ}, the set is well defined. An example of such a group is where the gro
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea