TOPICS
Search

Search Results for ""


1721 - 1730 of 4217 for Strong Lawof Small NumbersSearch Results
An object created by folding a piece of paper along certain lines to form loops. The number of states possible in an n-flexagon is a Catalan number. By manipulating the ...
The Gaussian joint variable theorem, also called the multivariate theorem, states that given an even number of variates from a normal distribution with means all 0, (1) etc. ...
A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...
If f is continuous on a closed interval [a,b], and c is any number between f(a) and f(b) inclusive, then there is at least one number x in the closed interval such that ...
Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...
The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...
The rank of a matrix or a linear transformation is the dimension of the image of the matrix or the linear transformation, corresponding to the number of linearly independent ...
A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...
Place 2n balls in a bag and number them 1 to 2n, then pick half of them at random. The number of different possible sums for n=1, 2, 3, ... are then 2, 5, 10, 17, 26, ... ...
An ideal I of a partial order P is a subset of the elements of P which satisfy the property that if y in I and x<y, then x in I. For k disjoint chains in which the ith chain ...
1 ... 170|171|172|173|174|175|176 ... 422 Previous Next

...