TOPICS
Search

Search Results for ""


191 - 200 of 4217 for Strong Lawof Small NumbersSearch Results
Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...
A dozen dozen, also called a gross. 144 is a square number and a sum-product number.
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 or m=2,3, but only a small ...
Grinberg constructed a number of small cubic polyhedral graph that are counterexamples to Tait's Hamiltonian graph conjecture (i.e., that every 3-connected cubic graph is ...
Logic is the formal mathematical study of the methods, structure, and validity of mathematical deduction and proof. According to Wolfram (2002, p. 860), logic is the most ...
A Mersenne prime is a Mersenne number, i.e., a number of the form M_n=2^n-1, that is prime. In order for M_n to be prime, n must itself be prime. This is true since for ...
Due to Lebesgue and Brouwer. If an n-dimensional figure is covered in any way by sufficiently small subregions, then there will exist points which belong to at least n+1 of ...
Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...
The number 1. There are n nth roots of unity, known as the de Moivre numbers.
An icositetrahedron is a 24-faced polyhedron. Examples include the deltoidal icositetrahedron, pentagonal icositetrahedron, small triakis octahedron, and tetrakis hexahedron.
1 ... 17|18|19|20|21|22|23 ... 422 Previous Next

...