知识卡片
卡迈克尔数能骗过多底费马检验
卡迈克尔数虽为合数,却对所有与其互素的底数a满足a^{n−1}≡1 mod n。
多换几个底数做单纯费马检验仍无法消除全部误判;非互素底数虽可揭示合数,却可能难找到。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
Unfortunately, even checking for several values of a does not eliminate all errors, because there exist composite integers n, known as Carmichael numbers, that satisfy equation (31.39) for all . (The equation does fail when gcd(a, n) > 1—that is, when —but demonstrating that n is composite by finding such an a can be difficult if n has only large prime factors.) The first three Carmichael numbers are 561, 1105, and 1729.
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[75000,80000))。
- 结论依据:原书第31.8节的素性判定方法、证人伪代码或定理;相关公式图已核对。
- 原始内容:Unfortunately, even checking for several values of a does not eliminate all errors, because there exist composite integers n , known as Carmichael numbers , that satisfy equation (31.39) for all . (The equation does fail when gcd( a , n ) > 1—that is, when —but demonstrating that n is composite by finding such an a can be difficult if n has only large prime factors.) The first three Carmichael numbers are 561, 1105, and 1729.