Search Results for ""

The portion of number theory concerned with expressing an integer as a sum of integers from some given set.

A group in which any decreasing chain of distinct subgroups terminates after a finite number.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

A class number formula is a finite series giving exactly the class number of a ring. For a ring of quadratic integers, the class number is denoted h(d), where d is the ...

If the average number of envelopes per pigeonhole is a, then some pigeonhole will have at least a envelopes. Similarly, there must be a pigeonhole with at most a envelopes.

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

A matrix is ill-conditioned if the condition number is too large (and singular if it is infinite).

The number of inward directed graph edges from a given graph vertex in a directed graph.

Given a convex plane region with area A and perimeter p, then |N-A|<p, where N is the number of enclosed lattice points.