原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
l to –1. Return FALSE, since a is not a witness to the compositeness of n. X = 〈…, d, 1, …
, 1〉, where d ≠ ±1: the sequence X ends in 1, but the last non-1 is not –1. Return TRUE in line 6: a is a witness to the compositeness of n, since d is a nontrivial square root of 1. Now,
let’s examine the Miller-Rabin primality test based on how it uses the WITNESS procedure.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea