Search Results for ""

The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...

The number 24 is equal to 4! (four factorial). A number puzzle asks to construct 24 in as many ways possible using elementary mathematical operations on three copies of the ...

Alexandrov's theorem addresses conditions under which a polygon will fold into a convex polyhedron (Malkevitch).

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...

A group having continuous group operations. A continuous group is necessarily infinite, since an infinite group just has to contain an infinite number of elements. But some ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

A number puzzle in which a group of arithmetical operations has some or all of its digits replaced by letters or symbols, and where the original digits must be found. In such ...

A branch of game theory dealing with strategies to maximize the outcome of a given process in the face of uncertain conditions.

A diminished polyhedron is a polyhedron in which one or more groups of associated faces (such as those comprising the top of a pyramid or cupola in the case of a Johnson ...