On Wed, 19 Sep 2012, GitHub wrote: > Log Message: > ----------- > Add expmod and is-prime as built-ins in Int
> +Returns True if C<$x> is known to be a prime, or is likely to be a > +prime based on a probabilistic Miller-Rabin test. (The optional > +argument tells how many times to iterate the probabilistic test, > +if such is necessary.) > + > +Returns False if C<$x> is known not to be a prime, or is unlikely to > +be a prime after probabilistic testing. Isn't Miller-Rabin definitive when it disproves primality? In which case the probabilistic qualifier in the last paragraph isn't needed. Or is this just to allow that some better (presumably faster or more probable) non-deterministic primality test might be used in the future? (Though Miller-Rabin is already pretty fast, so there seems little reason not to incorporate it as part of any future test.) But in that case, we should be saying up front that the test might change. -Martin
