Search Results for ""

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

A sequence of random variates X_0, X_1, ... is called absolutely fair if for n=1, 2, ..., <X_1>=0 and <X_(n+1)|X_1,...,X_n>=0 (Feller 1971, p. 210).

A term in logic meaning pertaining to truth and falsehood.

The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].

The process used to generate an expression for a covariant in the first degree of any one of the equivalent sets of coefficients for a curve.

In general, the catacaustics of the astroid are complicated curves. For an astroid with parametric equations x = cos^3t (1) y = sin^3t, (2) the catacaustic for a radiant ...

Axiomatic set theory is a version of set theory in which axioms are taken as uninterpreted rather than as formalizations of pre-existing truths.

A graph with graph edges of two possible "colors," usually identified as red and blue. For a bichromatic graph with R red graph edges and B blue graph edges, R+B>=2.

The smallest unit of binary information, equal to a single 0 or 1. Two bits are called a crumb, four bits are called a nibble, and eight bits are called 1 byte.

The simplest dissection of a square into rectangles of the same areas but different shapes, composed of the seven pieces illustrated above. The square is 210 units on a side, ...