Search Results for ""

A formula of first-order logic is in prenex normal form if it is of the form Q_1x_1...Q_nx_nM, (1) where each Q_i is a quantifier forall ("for all") or exists ("exists") and ...

A nonzero and noninvertible element a of a ring R which generates a prime ideal. It can also be characterized by the condition that whenever a divides a product in R, a ...

The semiperimeter on a figure is defined as s=1/2p, (1) where p is the perimeter. The semiperimeter of polygons appears in unexpected ways in the computation of their areas. ...

A Stoneham number is a number alpha_(b,c) of the form alpha_(b,c)=sum_(k=1)^infty1/(b^(c^k)c^k), where b,c>1 are relatively prime positive integers. Stoneham (1973) proved ...

A superabundant number is a composite number n such that sigma(n)/n>sigma(k)/k for all k<n, where sigma(n) is the divisor function. Superabundant numbers are closely related ...

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 ...

A ring defined on a singleton set {*}. The ring operations (multiplication and addition) are defined in the only possible way, *·*=*, (1) and *+*=*. (2) It follows that this ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...

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, ...

A nonzero element x of a ring for which x·y=0, where y is some other nonzero element and the multiplication x·y is the multiplication of the ring. A ring with no zero ...