Search Results for ""

An outlier is an observation that lies outside the overall pattern of a distribution (Moore and McCabe 1999). Usually, the presence of an outlier indicates some sort of ...

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...

A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...

There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...

Wang's conjecture states that if a set of tiles can tile the plane, then they can always be arranged to do so periodically (Wang 1961). The conjecture was refuted when Berger ...

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!

A hyperfunction, discovered by Mikio Sato in 1958, is defined as a pair of holomorphic functions (f,g) which are separated by a boundary gamma. If gamma is taken to be a ...

A planar convex quadrilateral consisting of two adjacent sides of length a and the other two sides of length b. The rhombus is a special case of the kite, and the lozenge is ...

A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...