原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
orem 31.34 in Section 31.8 to prove the Miller-Rabin primality-testing procedure correct.
Corollary 31.35 If there exists a nontrivial square root of 1, modulo n, then n is composite. Proof By the contrapositive of Theorem 31.34, if there exists a nontrivial square root of 1, modulo n, then n cannot be an odd prime or a power of an odd prime. Nor can n be 2, because if x2 = 1 (mod 2), then x = 1 (mod 2), and
therefore, all square roots of 1, modulo 2, are trivial. Thus, n cannot be prime. Finally
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea