Search Results for ""

A primefree sequence is sequence whose terms are never prime. Graham (1964) proved that there exist relatively prime positive integers a and b such that the recurrence ...

Define a = d(u,v)d(w,x) (1) b = d(u,w)d(v,x) (2) c = d(u,x)d(v,w), (3) where u, v, w, and x are vertices of a graph and d(i,j) is the graph distance between vertices i and j. ...

Rule 28 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Rule 50 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Rule 94 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Let X be a set of urelements, and let V(X) be the superstructure with X as its set of individuals. Let kappa be a cardinal number. An enlargement V(^*X) is kappa-saturated ...

Schur's partition theorem lets A(n) denote the number of partitions of n into parts congruent to +/-1 (mod 6), B(n) denote the number of partitions of n into distinct parts ...

A correction which must be applied to the measured moments m_k obtained from normally distributed data which have been binned in order to obtain correct estimators mu^^_i for ...

The Smale horseshoe map consists of a sequence of operations on the unit square. First, stretch in the y direction by more than a factor of two, then compress in the x ...

Taylor's theorem states that any function satisfying certain conditions may be represented by a Taylor series, Taylor's theorem (without the remainder term) was devised by ...