differences
(0.000 seconds)
21—30 of 176 matching pages
21: 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).
22: 11.13 Methods of Computation
§11.13(v) Difference Equations
►Sequences of values of and , with fixed, can be computed by application of the inhomogeneous difference equations (11.4.23) and (11.4.25). …23: 28.26 Asymptotic Approximations for Large
24: 7.7 Integral Representations
25: Mathematical Introduction
complex plane (excluding infinity). | |
… | |
(or ) | forward difference operator: . |
(or ) | backward difference operator: . (See also del operator in the Notations section.) |
… |
26: 18.19 Hahn Class: Definitions
Hahn class (or linear lattice class). These are OP’s where the role of is played by or or (see §18.1(i) for the definition of these operators). The Hahn class consists of four discrete and two continuous families.
Wilson class (or quadratic lattice class). These are OP’s ( of degree in , quadratic in ) where the role of the differentiation operator is played by or or . The Wilson class consists of two discrete and two continuous families.