Search Results for ""

An odd chordless cycle is a chordless cycle of length >4. A graph is said to be perfect iff neither the graph G nor its graph complement G^_ has an odd chordless cycle. A ...

The sum of the first n odd numbers is a square number, sum_(k=1)^n(2k-1)=n^2. A sort of converse also exists, namely the difference of the nth and (n-1)st square numbers is ...

The odd part Od(n) of a positive integer n is defined by Od(n)=n/(2^(b(n))), where b(n) is the exponent of the exact power of 2 dividing n. Od(n) is therefore the product of ...

Any prime number other than 2 (which is the unique even prime). Humorously, 2 is therefore the "oddest" prime.

A sequence of n 0s and 1s is called an odd sequence if each of the n sums sum_(i=1)^(n-k)a_ia_(i+k) for k=0, 1, ..., n-1 is odd.

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

Betting odds are written in the form r:s ("r to s") and correspond to the probability of winning P=s/(r+s). Therefore, given a probability P, the odds of winning are ...

An expression that is of a given type. For example, all primes p>3 are "of the form" 6n+/-1. The term "of shape" is sometimes also used.

Any continuous cumulative frequency curve, such as the one illustrated above in the right figure.

Except for convex polygons, every simple polygon has at least one mouth.