← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.759Z

up modulo n is |ℤn| = n. Figure 31.2(a) gives the operation table for the group (ℤ6, +6).

Theorem 31.12 The system (ℤn, +n) is a finite abelian group. Proof Equation (31.19) shows that (ℤn, +n) is closed. Associativity and commutativity of +n follow from the associativity and commutativity of +: ([a]n +n [b]n) +n [c]n = [a + b]n +n [c]n = [(a + b) + c]n = [a + (b + c)]n = [a]n +n [b + c]n = [a]n +n ([b]n +n [c]

n), [a]n +n [b]n = [a + b]n = [b + a]n = [b]n +n [a]n. The identity element of (ℤn, +n) is

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea