Search Results for ""

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 problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...

If r is an algebraic number of degree n, then the totality of all expressions that can be constructed from r by repeated additions, subtractions, multiplications, and ...

Given a sample of n variates X_1, ..., X_N, reorder them so that Y_1<Y_2<...<Y_N. Then Y_i is called the ith order statistic (Hogg and Craig 1970, p. 146), sometimes also ...

product_(k=1)^(infty)(1-x^k) = sum_(k=-infty)^(infty)(-1)^kx^(k(3k+1)/2) (1) = 1+sum_(k=1)^(infty)(-1)^k[x^(k(3k-1)/2)+x^(k(3k+1)/2)] (2) = (x)_infty (3) = ...

Every nonconstant entire function attains every complex value with at most one exception (Henrici 1988, p. 216; Apostol 1997). Furthermore, every analytic function assumes ...

A sequence of n-tuples that fills n-space more uniformly than uncorrelated random points, sometimes also called a low-discrepancy sequence. Although the ordinary uniform ...

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 Smarandache-Wellin number that is prime is known as a Smarandache-Wellin prime. Concatenations of the first n=1, 2, 4, 128, 174, 342, 435, 1429 (OEIS A046035; Ibstedt 1998, ...

A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...