Search Results for ""

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

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

The cumulative frequency in a frequency distribution divided by the total number of data points.

The ratio of the absolute frequency to the total number of data points in a frequency distribution.

The sequency k of a Walsh function is defined as half the number of zero crossings in the time base.

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

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

A product involving an infinite number of terms. Such products can converge. In fact, for positive a_n, the product product_(n=1)^(infty)a_n converges to a nonzero number iff ...

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary ...