Search Results for ""

The reciprocity theorem for x^8=q (mod p).

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 graph vertex in a graph is said to be an odd node if its vertex degree is odd.

A set of maximum degree to which all other degrees of recursively enumerable sets can be one-one reduced. If set A is many-one complete, then it is one-one complete, and vice ...

A right or left ideal of a ring. The term is used especially in noncommutative rings to denote a right ideal that is not a left ideal, or conversely.

Let A be a set. An operation on A is a function from a power of A into A. More precisely, given an ordinal number alpha, a function from A^alpha into A is an alpha-ary ...

Let A:D(A)->H and B:D(B)->H be linear operators from domains D(A) and D(B), respectively, into a Hilbert space H. It is said that B extends A if D(A) subset D(B) and if Bv=Av ...