Search Results for ""

A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...

The subset B of the Euclidean plane formed by the union of the interval [0,1] of the x-axis and all line segments of unit length passing through the origin which form an ...

An equation representing a locus L in the n-dimensional Euclidean space. It has the form L:f(x_1,...,x_n)=0, (1) where the left-hand side is some expression of the Cartesian ...

The "Cartesian ovals," sometimes also known as the Cartesian curve or oval of Descartes, are the quartic curve consisting of two ovals. They were first studied by Descartes ...

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

A class of formal series expansions in derivatives of a distribution Psi(t) which may (but need not) be the normal distribution function Phi(t)=1/(sqrt(2pi))e^(-t^2/2) (1) ...

A Chen prime is a prime number p for which p+2 is either a prime or semiprime. Chen primes are named after Jing Run Chen who proved in 1966 that there are infinitely many ...

Let V be an n-dimensional linear space over a field K, and let Q be a quadratic form on V. A Clifford algebra is then defined over T(V)/I(Q), where T(V) is the tensor algebra ...

A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...

A conical frustum is a frustum created by slicing the top off a cone (with the cut made parallel to the base). For a right circular cone, let s be the slant height and R_1 ...