prime numbers
(0.003 seconds)
11—20 of 106 matching pages
11: 25.1 Special Notation
12: 27.11 Asymptotic Formulas: Partial Sums
13: 6.16 Mathematical Applications
14: 25.15 Dirichlet -functions
15: Tom M. Apostol
16: 25.16 Mathematical Applications
§25.16(i) Distribution of Primes
… ►17: 24.10 Arithmetic Properties
18: 25.10 Zeros
19: Bibliography N
20: 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).
GIMPS. This includes updates of the largest known Mersenne prime.
Number Theory Web. References and links to software for factorization and primality testing.
Prime Pages. Information on primes, primality testing, and factorization including links to programs and lists of primes.