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

An odd power is a number of the form m^n for m>0 an integer and n a positive odd integer. The first few odd powers are 1, 8, 27, 32, 64, 125, 128, 216, 243, 343, 512, ... ...

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.

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.

A linear real-valued function omega^1 of vectors v such that omega^1(v)|->R. Vectors (i.e., contravariant vectors or "kets" |psi>) and one-forms (i.e., covariant vectors or ...

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