elliptic form
(0.003 seconds)
21—30 of 51 matching pages
21: 23.21 Physical Applications
22: 22.8 Addition Theorems
§22.8 Addition Theorems
… ►§22.8(ii) Alternative Forms for Sum of Two Arguments
… ►§22.8(iii) Special Relations Between Arguments
… ►If sums/differences of the ’s are rational multiples of , then further relations follow. …23: 36.10 Differential Equations
24: 36.7 Zeros
§36.7(iii) Elliptic Umbilic Canonical Integral
… ►The zeros are lines in space where is undetermined. Deep inside the bifurcation set, that is, inside the three-cusped astroid (36.4.10) and close to the part of the -axis that is far from the origin, the zero contours form an array of rings close to the planes …Away from the -axis and approaching the cusp lines (ribs) (36.4.11), the lattice becomes distorted and the rings are deformed, eventually joining to form “hairpins” whose arms become the pairs of zeros (36.7.1) of the cusp canonical integral. …Outside the bifurcation set (36.4.10), each rib is flanked by a series of zero lines in the form of curly “antelope horns” related to the “outside” zeros (36.7.2) of the cusp canonical integral. …25: 23.18 Modular Transformations
Elliptic Modular Function
… ►according as the elements of in (23.15.3) have the respective forms … ►26: 19.31 Probability Distributions
§19.31 Probability Distributions
► and occur as the expectation values, relative to a normal probability distribution in or , of the square root or reciprocal square root of a quadratic form. …27: 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.