Search Results for ""
141 - 150 of 4217 for Strong Lawof Small NumbersSearch Results
![](/common/images/search/spacer.gif)
The robustness of a given outcome to small changes in initial conditions or small random fluctuations. Chaos is an example of a process which is not stable.
For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...
Four line geometry is a finite geometry subject to the following three axioms: 1. there exist exactly four lines, 2. any two distinct lines have exactly one point of on both ...
Dual pairs of linear programs are in "strong duality" if both are possible. The theorem was first conceived by John von Neumann. The first written proof was an Air Force ...
A quantity which rigorously assumes the value of zero is said to be identically zero. The "identically" is used for emphasis when simply stating that a quantity is (or ...
Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 and m=2,3, but only a small ...
Kepler's original name for the small stellated dodecahedron.
A Latin square is said to be odd if it contains an odd number of rows and columns that are odd permutations. Otherwise, it is said to be even. Let the number of even Latin ...
A primality test is a test to determine whether or not a given number is prime, as opposed to actually decomposing the number into its constituent prime factors (which is ...
A doubly stochastic matrix is a matrix A=(a_(ij)) such that a_(ij)>=0 and sum_(i)a_(ij)=sum_(j)a_(ij)=1 is some field for all i and j. In other words, both the matrix itself ...
![](/common/images/search/spacer.gif)
...