Search Results for ""

The elliptic curve factorization method, abbreviated ECM and sometimes also called the Lenstra elliptic curve method, is a factorization algorithm that computes a large ...

Elliptic curve primality proving, abbreviated ECPP, is class of algorithms that provide certificates of primality using sophisticated results from the theory of elliptic ...

Let the elliptic modulus k satisfy 0<k^2<1, and the Jacobi amplitude be given by phi=amu with -pi/2<phi<pi/2. The incomplete elliptic integral of the first kind is then ...

Let the elliptic modulus k satisfy 0<k^2<1. (This may also be written in terms of the parameter m=k^2 or modular angle alpha=sin^(-1)k.) The incomplete elliptic integral of ...

Erfc is the complementary error function, commonly denoted erfc(z), is an entire function defined by erfc(z) = 1-erf(z) (1) = 2/(sqrt(pi))int_z^inftye^(-t^2)dt. (2) It is ...

Euclid's second theorem states that the number of primes is infinite. The proof of this can be accomplished using the numbers E_n = 1+product_(i=1)^(n)p_i (1) = 1+p_n#, (2) ...

The Euler-Maclaurin integration and sums formulas can be derived from Darboux's formula by substituting the Bernoulli polynomial B_n(t) in for the function phi(t). ...

There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...

The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...

A prime p for which 1/p has a maximal period decimal expansion of p-1 digits. Full reptend primes are sometimes also called long primes (Conway and Guy 1996, pp. 157-163 and ...