原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
s PRIME. We have that (or equivalently, that Pr{B | A} = 1) and (or equivalently, that ).
But what is Pr{A | B}, the probability that n is prime, given that MILLER-RABIN has returned PRIME? By the alternate form of Bayes’s theorem (equation (C.20) on page 1189) and approximating , we have This probability does not exceed 1/2 until s exceeds 1g(ln n – 1). Intuitively, that many initial trials are needed just for the confidence derived from failing to find a witness to the
compositeness of n to overcome the prior bias in favor of n being composite. For a number
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea