知识卡片
模乘法只在与模互素的类成群
模n乘法的群只包含与n互素的剩余类,才保证每个元素有乘法逆元;
全体剩余类一般不构成乘法群。
判断能否“除以a”,先检查gcd(a,n)=1。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
The elements of this group are the set of elements in ℤn that are relatively prime to n, so that each one has a unique inverse, modulo n: To see that is well defined, note that for 0 ≤ a < n, we have a = (a + kn) (mod n) for all integers k. By Exercise 31.2-3, therefore, gcd(a, n) = 1 implies gcd(a + kn, n) = 1 for all integers k. Since [a]
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[25000,30000))。
- 结论依据:原文给出最大公约数递推、扩展算法或模运算群的定义和证明;公式图已核对。
- 原始内容:The elements of this group are the set of elements in ℤ n that are relatively prime to n , so that each one has a unique inverse, modulo n : To see that is well defined, note that for 0 ≤ a < n , we have a = ( a + kn ) (mod n ) for all integers k . By Exercise 31.2-3, therefore, gcd( a , n ) = 1 implies gcd( a + kn , n ) = 1 for all integers k . Since [ a ]