Search Results for ""

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.

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

The only Wiedersehen surfaces are the standard round spheres. The conjecture was proven by combining the Berger-Kazdan comparison theorem with A. Weinstein's results for n ...

A Bloch vector is a unit vector (cosphisintheta, sinphisintheta, costheta) used to represent points on a Bloch sphere.

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

A two-dimensional map which is conjugate to the Hénon map in its nondissipative limit. It is given by x^' = x+y^' (1) y^' = y+epsilony+kx(x-1)+muxy. (2)

An occurrence of a variable in a logic which is not free. Bound variables are also called dummy variables.

The boustrophedon ("ox-plowing") transform b of a sequence a is given by b_n = sum_(k=0)^(n)(n; k)a_kE_(n-k) (1) a_n = sum_(k=0)^(n)(-1)^(n-k)(n; k)b_kE_(n-k) (2) for n>=0, ...

Brocard's conjecture states that pi(p_(n+1)^2)-pi(p_n^2)>=4 for n>=2, where pi(n) is the prime counting function and p_n is the nth prime. For n=1, 2, ..., the first few ...