Search Results for ""

A substitution system in which rules are used to operate on a string consisting of letters of a certain alphabet. String rewriting systems are also variously known as ...

A term meaning "spinning top" in Greek which was coined by J. H. Conway by e-mail in the Polyhedron Discussion List as a term for kite-shaped quadrilaterals. Formally, a ...

Strong convergence is the type of convergence usually associated with convergence of a sequence. More formally, a sequence {x_n} of vectors in a normed space (and, in ...

A subspace A of X is called a strong deformation retract of X if there is a homotopy F:X×I->X (called a retract) such that for all x in X, a in A, and t in I, 1. F(x,0)=x, 2. ...

Let n be an elliptic pseudoprime associated with (E,P), and let n+1=2^sk with k odd and s>=0. Then n is a strong elliptic pseudoprime when either kP=0 (mod n) or 2^rkP=0 (mod ...

A pseudoprime which obeys an additional restriction beyond that required for a Frobenius pseudoprime. A number n with (n,2a)=1 is a strong Frobenius pseudoprime with respect ...

The sequence of variates X_i with corresponding means mu_i obeys the strong law of large numbers if, to every pair epsilon,delta>0, there corresponds an N such that there is ...

The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...

Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Let n be an odd composite number with (n,D)=1, and n-(D/n)=2^sd with d odd and s>=0, ...

The theorem, originally conjectured by Berge (1960, 1961), that a graph is perfect iff neither the graph nor its graph complement contains an odd graph cycle of length at ...