原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
mallest positive integer t such that a(t) = e. (Recall that e ∈ S is the group identity.)
Theorem 31.17 For any finite group (S, ⊕) and any a ∈ S, the order of a is equal to the size of the subgroup it generates, or ord(a) = |〈a〉|. Proof Let t = ord(a). Since a(t) = e and a(t+k) = a(t) ⊕ a(k) = a(k) for k ≥ 1, if i > t, then a(i) = a(j) for some j < i. Therefore, as we generate elements by a, we see no new
elements after a(t). Thus, 〈a〉 = {a(1), a(2), …, a(t)}, and so |〈a〉| ≤ t. To show that |〈
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea