Search Results for ""

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.

A family of subsets of a topological space such that every point has a neighborhood which intersects only a finite number of them.

A very large number defined in terms of circle notation by Steinhaus (1983) as .

A multiplicative number theoretic function is a number theoretic function f that has the property f(mn)=f(m)f(n) (1) for all pairs of relatively prime positive integers m and ...

The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...

A number theoretic function is a function whose domain is the set of positive integers.

Any prime number other than 2 (which is the unique even prime). Humorously, 2 is therefore the "oddest" prime.