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 ...

The second singular value k_2, corresponding to K^'(k_2)=sqrt(2)K(k_2), (1) is given by k_2 = tan(pi/8) (2) = sqrt(2)-1 (3) k_2^' = sqrt(2)(sqrt(2)-1). (4) For this modulus, ...

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

The polynomials M_k(x;delta,eta) which form the Sheffer sequence for g(t) = {[1+deltaf(t)]^2+[f(t)]^2}^(eta/2) (1) f(t) = tan(t/(1+deltat)) (2) which have generating function ...

An integral equation of the form f(x)=int_a^xK(x,t)phi(t)dt, where K(x,t) is the integral kernel, f(x) is a specified function, and phi(t) is the function to be solved for.

An integral equation of the form phi(x)=f(x)+int_a^xK(x,t)phi(t)dt, where K(x,t) is the integral kernel, f(x) is a specified function, and phi(t) is the function to be solved ...

For R[n]>-1 and R[z]>0, Pi(z,n) = n^zint_0^1(1-x)^nx^(z-1)dx (1) = (n!)/((z)_(n+1))n^z (2) = B(z,n+1), (3) where (z)_n is the Pochhammer symbol and B(p,q) is the beta ...

Q_n^((alpha,beta))(x)=2^(-n-1)(x-1)^(-alpha)(x+1)^(-beta) ×int_(-1)^1(1-t)^(n+alpha)(1+t)^(n+beta)(x-t)^(-n-1)dt. In the exceptional case n=0, alpha+beta+1=0, a nonconstant ...

The third singular value k_3, corresponding to K^'(k_3)=sqrt(3)K(k_3), (1) is given by k_3=sin(pi/(12))=1/4(sqrt(6)-sqrt(2)). (2) As shown by Legendre, ...

Define the nome by q=e^(-piK^'(k)/K(k))=e^(ipitau), (1) where K(k) is the complete elliptic integral of the first kind with modulus k, K^'(k)=K(sqrt(1-k^2)) is the ...