strong
♦
8 matching pages ♦
(0.000 seconds)
8 matching pages
1: 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).
2: Charles W. Clark
…
► Taylor), published by Plenum Press in 1988, and Atoms in
Strong Fields (with M.
…
3: 17.12 Bailey Pairs
…
►
Strong Bailey Lemma
…4: Philip J. Davis
…
►In 1957, Davis took over as Chief, Numerical Analysis Section when John Todd and his wife Olga Taussky-Todd, feeling a strong pull toward teaching and research, left to pursue full-time positions at the California Institute of Technology.
…
5: Bibliography I
…
►
Statistical Field Theory: Strong Coupling, Monte Carlo Methods, Conformal Field Theory, and Random Systems.
Vol. 2, Cambridge University Press, Cambridge.
…
6: Bibliography D
…
►
Strong and ratio asymptotics for Laguerre polynomials revisited.
J. Math. Anal. Appl. 403 (2), pp. 477–486.
…
►
Strong asymptotics of orthogonal polynomials with respect to exponential weights.
Comm. Pure Appl. Math. 52 (12), pp. 1491–1552.
…
7: Bibliography G
…
►
Quantum Electrodynamics of Strong Fields: With an Introduction into Modern Relativistic Quantum Mechanics.
Texts and Monographs in Physics, Springer.
…
8: Bibliography K
…
►
Strong asymptotics of polynomials orthogonal with respect to Freud weights.
Internat. Math. Res. Notices 1999 (6), pp. 299–333.
…