← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

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

, 2, 4, 0, …. We have a(k) = ka mod n in the group ℤn, and a(k) = ak mod n in the group .

We define the subgroup generated by a, denoted 〈a〉 or (〈a〉, ⊕), by 〈a〉 = {a(k) : k ≥ 1}. We say that a generates the subgroup 〈a〉 or that a is a generator of 〈a〉. Since S is finite, 〈a〉 is a finite subset of S, possibly including all of S. Since the associativity of ⊕ implies a(i) ⊕ a(j) = a(i+j), 〈a〉 is closed and therefore, by Theorem 31.14, 〈a〉 is a subgroup of S.

For example, in ℤ6, we have 〈0〉 = {0}, 〈1〉 = {0, 1, 2, 3, 4, 5}, 〈2〉 = {0, 2, 4}. Similar

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea