知识卡片
单个元素生成循环子群
在有限群中反复对元素a施加群运算,得到的不同元素组成由a生成的子群。这个集合非空且对运算封闭;a的阶是第一次回到单位元的最小正次数,不一定等于整个群的大小。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
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.
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[30000,35000))。
- 结论依据:原文对逆元、欧拉函数、子群阶与模线性方程的定理及证明;公式图已核对。
- 原始内容: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 .