Elliptic pseudoprime

In number theory, a pseudoprime is called an elliptic pseudoprime for (E, P), where E is an elliptic curve defined over the field of rational numbers with complex multiplication by an order in $\mathbb{Q} \big(\sqrt{- d} \big)$ , having equation y² = x³ + ax + b with a, b integers, P being a point on E and n a natural number such that the Jacobi symbol (−d | n) = −1, if (n + 1)P ≡ 0 (mod n).

The number of elliptic pseudoprimes less than X is bounded above, for large X, by

X / \exp((1/3)\log X \log\log\log X /\log\log X) \ .

References

Gordon, Daniel M.; Pomerance, Carl (1991). "The distribution of Lucas and elliptic pseudoprimes". Mathematics of Computation. 57 (196): 825–838. doi:10.2307/2938720. Zbl 0774.11074.

Powers and
related numbers

Of the form
a × 2^b ± 1

Other polynomial
numbers

Recursively defined
numbers

Possessing a
specific set
of other numbers

Expressible via
specific sums

Generated
via a sieve

Code related

centered	Centered triangular Centered square Centered pentagonal Centered hexagonal Centered heptagonal Centered octagonal Centered nonagonal Centered decagonal Star

non-centered	Triangular Square Square triangular Pentagonal Hexagonal Heptagonal Octagonal Nonagonal Decagonal Dodecagonal

centered	Centered tetrahedral Centered cube Centered octahedral Centered dodecahedral Centered icosahedral

non-centered	Tetrahedral Octahedral Dodecahedral Icosahedral Stella octangula

pyramidal	Square pyramidal Pentagonal pyramidal Hexagonal pyramidal Heptagonal pyramidal

centered	Centered pentachoric Squared triangular

non-centered	Pentatope

Combinatorial
numbers

By properties of σ(n)	Abundant Almost perfect Arithmetic Colossally abundant Descartes Hemiperfect Highly abundant Highly composite Hyperperfect Multiply perfect Perfect Practical number Primitive abundant Quasiperfect Refactorable Sublime Superabundant Superior highly composite Superperfect

By properties of Ω(n)	Almost prime Semiprime

By properties of φ(n)	Highly cototient Highly totient Noncototient Nontotient Perfect totient Sparsely totient

By properties of s(n)	Amicable Betrothed Deficient Semiperfect

Dividing a quotient

Other prime factor
or divisor related
numbers

Base-dependent
numbers

This article is issued from Wikipedia - version of the 5/10/2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.