Search Results for ""
2051 - 2060 of 5719 for Numbered Equation 6Search Results
The length of a number n in base b is the number of digits in the base-b numeral for n, given by the formula L(n,b)=|_log_b(n)_|+1, where |_x_| is the floor function. The ...
The ratio of two numbers r and s is written r/s, where r is the numerator and s is the denominator. The ratio of r to s is equivalent to the quotient r/s. Betting odds ...
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 ...
For any ordinal number alpha, the successor of alpha is alpha union {alpha} (Ciesielski 1997, p. 46). The successor of an ordinal number alpha is therefore the next ordinal, ...
Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...
Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The ...
The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...
The winding number of a contour gamma about a point z_0, denoted n(gamma,z_0), is defined by n(gamma,z_0)=1/(2pii)∮_gamma(dz)/(z-z_0) and gives the number of times gamma ...
The maximum number of disjoint dominating sets in a domatic partition of a graph G is called its domatic number d(G). The domatic number should not be confused with the ...
The Heesch number of a closed plane figure is the maximum number of times that figure can be completely surrounded by copies of itself. The determination of the maximum ...
...
View search results from all Wolfram sites (314326 matches)

