multiple
(0.001 seconds)
21—30 of 91 matching pages
21: 10.44 Sums
§10.44(i) Multiplication Theorem
…22: 4.31 Special Values and Limits
23: 13.27 Mathematical Applications
24: 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).
25: 27.19 Methods of Computation: Factorization
26: About Color Map
27: 4.17 Special Values and Limits
28: 13.13 Addition and Multiplication Theorems
29: 13.26 Addition and Multiplication Theorems
30: Errata
The constraint was added.
The factor originally used in the denominator has been corrected to be .
The multi-product notation in the denominator of the right-hand side was used.
The numerators of the leftmost fractions were corrected to read and instead of and , respectively.
Reported 2017-06-26 by Jason Zhao.
An addition was made to the Software Index to reflect a multiple precision (MP) package written in C++ which uses a variety of different MP interfaces. See Kormanyos (2011).