知识卡片
模线性方程有解时恰有公因数个解
若ax≡b(mod n)有解,且d=gcd(a,n),则在模n下恰有d个不同解;若d不整除b则一个也没有。
原因是序列ax mod n的周期为n/d,在n个候选x中重复d次。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
Corollary 31.22 The equation ax = b (mod n) either has d distinct solutions modulo n, where d = gcd(a, n), or it has no solutions. Proof If ax = b (mod n) has a solution, then b ∈ 〈a〉. By Theorem 31.17, ord(a) = |〈a〉|, and so Corollary 31.18 and Theorem 31.20 imply that the sequence ai mod n, for i = 0, 1,
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[35000,40000))。
- 结论依据:原文对逆元、欧拉函数、子群阶与模线性方程的定理及证明;公式图已核对。
- 原始内容:Corollary 31.22 The equation ax = b (mod n ) either has d distinct solutions modulo n , where d = gcd( a , n ), or it has no solutions. Proof If ax = b (mod n ) has a solution, then b ∈ 〈 a 〉 . By Theorem 31.17, ord( a ) = | 〈 a 〉 |, and so Corollary 31.18 and Theorem 31.20 imply that the sequence ai mod n , for i = 0, 1, …, is periodic with