Search Results for ""

Given a chord PQ of a circle, draw any other two chords AB and CD passing through its midpoint. Call the points where AD and BC meet PQ X and Y. Then M is also the midpoint ...

A binary unit of information equal to 8 bits. Unfortunately, the storage of binary numbers in computers is not entirely standardized. Because computers store information in ...

A C-matrix is a symmetric (C^(T)=C) or antisymmetric (C^(T)=-C) C_n (-1,0,1)-matrix with diagonal elements 0 and others +/-1 that satisfies CC^(T)=(n-1)I, (1) where I is the ...

The nth cabtaxi number is the smallest positive number that can be written in n ways as a sum of two (not necessarily positive) cubes. The name derived from the taxicab ...

A Calkin-Wilf tree is a special type of binary tree obtained by starting with the fraction 1/1 and iteratively adding a/(a+b) and (a+b)/b below each fraction a/b. The ...

The Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(231,30,9,3). It is distance-regular with intersection array ...

A polyhedron is said to be canonical if all its polyhedron edges touch a sphere and the center of gravity of their contact points is the center of that sphere. In other ...

The Cantor diagonal method, also called the Cantor diagonal argument or Cantor's diagonal slash, is a clever technique used by Georg Cantor to show that the integers and ...

The Cantor function F(x) is the continuous but not absolutely continuous function on [0,1] which may be defined as follows. First, express x in ternary. If the resulting ...

Cards are a set of n rectangular pieces of cardboard with markings on one side and a uniform pattern on the other. The collection of all cards is called a "deck," and a ...