Search Results for ""

To define a recurring digital invariant of order k, compute the sum of the kth powers of the digits of a number n. If this number n^' is equal to the original number n, then ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...

A number traditionally associated with bad luck. A so-called baker's dozen is equal to 13. Fear of the number 13 is called triskaidekaphobia. There are 13 Archimedean solids. ...

The study of number fields by embedding them in a local field is called local class field theory. Information about an equation in a local field may give information about ...

A variety V of algebras is a strong variety provided that for each subvariety W of V, and each algebra A in V, if A is generated by its W- subalgebras, then A in W. In strong ...

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...

A circle-preserving transformation composed of an odd number of inversions.

The order of the polynomial defining an algebraic curve.