Search Results for ""

Consider the probability Q_1(n,d) that no two people out of a group of n will have matching birthdays out of d equally possible birthdays. Start with an arbitrary person's ...

Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...

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

Let V(r) be the volume of a ball of radius r in a complete n-dimensional Riemannian manifold with Ricci curvature tensor >=(n-1)kappa. Then V(r)<=V_kappa(r), where V_kappa is ...

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

A system of curvilinear coordinates variously denoted (xi,eta,phi) (Arfken 1970) or (theta,eta,psi) (Moon and Spencer 1988). Using the notation of Arfken, the bispherical ...

A square matrix is called bisymmetric if it is both centrosymmetric and either symmetric or antisymmetric (Muir 1960, p. 19).

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 number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.