知识卡片
群要求封闭单位元结合律与逆元
群由集合和二元运算构成,运算须封闭、满足结合律,且存在单位元与每个元素的逆元;
若还满足交换律,则是阿贝尔群。
检查模乘法能否构成群时,最容易漏掉并非每个剩余类都有逆元。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
A group (S, ⊕) is a set S together with a binary operation ⊕ defined on S for which the following properties hold: Closure: For all a, b ∈ S, we have a ⊕ b ∈ S. Identity: There exists an element e ∈ S, called the identity of the group, such that e ⊕ a = a ⊕ e = a for all a ∈ S. Associativity: For all a, b, c ∈ S, we have (a ⊕ b) ⊕ c = a ⊕ (b ⊕ c). Inverses: For each a ∈ S
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[25000,30000))。
- 结论依据:原文给出最大公约数递推、扩展算法或模运算群的定义和证明;公式图已核对。
- 原始内容:A group ( S , ⊕) is a set S together with a binary operation ⊕ defined on S for which the following properties hold: Closure: For all a , b ∈ S , we have a ⊕ b ∈ S . Identity: There exists an element e ∈ S , called the identity of the group, such that e ⊕ a = a ⊕ e = a for all a ∈ S . Associativity: For all a , b , c ∈ S , we have ( a ⊕ b ) ⊕ c = a ⊕ ( b ⊕ c ). Inverses: For each a ∈ S