Search Results for ""

The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

A number defined by b_n=b_n(0), where b_n(x) is a Bernoulli polynomial of the second kind (Roman 1984, p. 294), also called Cauchy numbers of the first kind. The first few ...

A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...

A binary bracketing is a bracketing built up entirely of binary operations. The number of binary bracketings of n letters (Catalan's problem) are given by the Catalan numbers ...

The maximum number of regions that can be created by n cuts using space division by planes, cube division by planes, cylinder cutting, etc., is given by N_(max)=1/6(n^3+5n+6) ...

A Cayley tree is a tree in which each non-leaf graph vertex has a constant number of branches n is called an n-Cayley tree. 2-Cayley trees are path graphs. The unique ...

The circumcircle of the Cevian triangle DeltaA^'B^'C^' of a given triangle DeltaABC with respect to a point P. The following table summarizes a number of named Cevian circles ...

The Christmas stocking theorem, also known as the hockey stick theorem, states that the sum of a diagonal string of numbers in Pascal's triangle starting at the nth entry ...

The colon is the symbol ":". It is used in a number of different ways in mathematics. 1. To denote ratio or odds, as in 2:1 (voiced "two to one"). 2. To mean such that in ...