Search Results for ""

A particular way of doing something, sometimes also called an algorithm or procedure. (According to Petkovšek et al. (1996), "a method is a trick that has worked at least ...

A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...

A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

A lattice which satisfies the identity (x ^ y) v (x ^ z)=x ^ (y v (x ^ z)) is said to be modular.

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...

A modular inverse of an integer b (modulo m) is the integer b^(-1) such that bb^(-1)=1 (mod m). A modular inverse can be computed in the Wolfram Language using PowerMod[b, ...

Given a elliptic modulus k in an elliptic integral, the modular angle alpha is defined by k=sinalpha. An elliptic integral is written I(phi|m) when the parameter m is used, ...

The modular equation of degree n gives an algebraic connection of the form (K^'(l))/(K(l))=n(K^'(k))/(K(k)) (1) between the transcendental complete elliptic integrals of the ...

A modular form which is not allowed to have poles in the upper half-plane H or at iinfty.