Search Results for ""

A characteristic factor is a factor in a particular factorization of the totient function phi(n) such that the product of characteristic factors gives the representation of a ...

There are at least two theorems known as Chebyshev's theorem. The first is Bertrand's postulate, proposed by Bertrand in 1845 and proved by Chebyshev using elementary methods ...

Every "large" even number may be written as 2n=p+m where p is a prime and m in P union P_2 is the set of primes P and semiprimes P_2.

Chevalley's theorem, also known as the Chevalley-Waring theorem, states that if f is a polynomial in F[x_1,...,x_n], where F is a finite field of field characteristic p, and ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

Let O be an order of an imaginary quadratic field. The class equation of O is the equation H_O=0, where H_O is the extension field minimal polynomial of j(O) over Q, with ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closable if it has a closed extension B:D(B)->H where D(A) subset D(B). Closable operators are ...

A coequalizer of a pair of maps f,g:X->Y in a category is a map c:Y->C such that 1. c degreesf=c degreesg, where degrees denotes composition. 2. For any other map c^':Y->C^' ...

The commutator subgroup (also called a derived group) of a group G is the subgroup generated by the commutators of its elements, and is commonly denoted G^' or [G,G]. It is ...