Search Results for ""

Let n be a positive nonsquare integer. Then Artin conjectured that the set S(n) of all primes for which n is a primitive root is infinite. Under the assumption of the ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

The number of data points which fall within a given class in a frequency distribution.

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.