原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
n either case, the number of witnesses to the compositeness of n is at least (n – 1)/2. ▪
Theorem 31.40 For any odd integer n > 2 and positive integer s, the probability that MILLER-RABIN(n, s) errs is at most 2–s. Proof By Theorem 31.39, if n is composite, then each execution of the for loop of lines 1–4 of MILLER-RABIN has a probability of at least 1/2 of discovering a witness to the compositeness of n. MILLER-RABIN makes an error only if it is so unlucky as to miss discovering a witness to the compositeness of n on each of the s
iterations of the main loop. The probability of such a sequence of misses is at most 2–s.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea