Monte-Carlo methods
(0.001 seconds)
31—40 of 151 matching pages
31: Alexander A. Its
32: Vadim B. Kuznetsov
33: 21.10 Methods of Computation
§21.10 Methods of Computation
…34: 27.20 Methods of Computation: Other Number-Theoretic Functions
§27.20 Methods of Computation: Other Number-Theoretic Functions
…35: 27.22 Software
Mathematica. PrimeQ combines strong pseudoprime tests for the bases 2 and 3 and a Lucas pseudoprime test. No known composite numbers pass these three tests, and Bleichenbacher (1996) has shown that this combination of tests proves primality for integers below . Provable PrimeQ uses the Atkin–Goldwasser–Kilian–Morain Elliptic Curve Method to prove primality. FactorInteger tries Brent–Pollard rho, Pollard , and then cfrac after trial division. See §27.19. ecm is available also, and the Multiple Polynomial Quadratic sieve is expected in a future release.
For additional Mathematica routines for factorization and primality testing, including several different pseudoprime tests, see Bressoud and Wagon (2000).
ECMNET Project. Links to software for elliptic curve methods of factorization and primality testing.