Search Results for ""

Doob (1996) defines a stochastic process as a family of random variables {x(t,-),t in J} from some probability space (S,S,P) into a state space (S^',S^'). Here, J is the ...

A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...

Let L be a language of the first-order logic. Assume that the language L has the following sets of nonlogical symbols: 1. C is the set of constant symbols of L. (These are ...

A second-order ordinary differential equation d/(dx)[p(x)(dy)/(dx)]+[lambdaw(x)-q(x)]y=0, where lambda is a constant and w(x) is a known function called either the density or ...

Let V be a real vector space (e.g., the real continuous functions C(I) on a closed interval I, two-dimensional Euclidean space R^2, the twice differentiable real functions ...

The superfactorial of n is defined by Pickover (1995) as n$=n!^(n!^(·^(·^(·^(n!)))))_()_(n!). (1) The first two values are 1 and 4, but subsequently grow so rapidly that 3$ ...

In nonstandard analysis, the limitation to first-order analysis can be avoided by using a construction known as a superstructure. Superstructures are constructed in the ...

In general, an unresolved nth root, commonly involving a radical symbol RadicalBox[x, n], is known as a surd. However, the term surd or "surd expression" (e.g., Hardy 1967, ...

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...

A recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers x, y, and z, it is defined by (1) This can be described more simply by t(x,y,z)={y if x<=y; {z ...