Search Results for ""

There are a number of meanings for the word "arc" in mathematics. In general, an arc is any smooth curve joining two points. The length of an arc is known as its arc length. ...

An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...

The n-ball, denoted B^n, is the interior of a sphere S^(n-1), and sometimes also called the n-disk. (Although physicists often use the term "sphere" to mean the solid ball, ...

Place two solid spheres of radius 1/2 inside a hollow sphere of radius 1 so that the two smaller spheres touch each other at the center of the large sphere and are tangent to ...

Bridge is a card game played with a normal deck of 52 cards. The number of possible distinct 13-card hands is N=(52; 13)=635013559600, (1) where (n; k) is a binomial ...

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...

Four circles c_1, c_2, c_3, and c_4 are tangent to a fifth circle or a straight line iff T_(12)T_(34)+/-T_(13)T_(42)+/-T_(14)T_(23)=0. (1) where T_(ij) is the length of a ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...

A Chaitin's constant, also called a Chaitin omega number, introduced by Chaitin (1975), is the halting probability of a universal prefix-free (self-delimiting) Turing ...