TOPICS
Search

Search Results for ""


101 - 110 of 4217 for Strong Lawof Small NumbersSearch Results
A positive number k such that a lamina or solid body with moment of inertia about an axis I and mass m is given by I=mk^2. Pickover (1995) defines a generalization of k as a ...
A round number is a number that is the product of a considerable number of comparatively small factors (Hardy 1999, p. 48). Round numbers are very rare. As Hardy (1999, p. ...
A valuation for which |x|<=1 implies |1+x|<=C for the constant C=1 (independent of x). Such a valuation does not satisfy the strong triangle inequality |x+y|<=max(|x|,|y|).
An integer n such that 3n^3 contains three consecutive 3s in its decimal representation is called a super-3 number. The first few super-3 numbers are 261, 462, 471, 481, 558, ...
A weak Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is both a weak pseudo-Riemannian metric and positive definite. In a very precise way, the ...
The set theory symbol aleph_0 refers to a set having the same cardinal number as the "small" infinite set of integers. The symbol aleph_0 is often pronounced "aleph-null" ...
A Smarandache-like function which is defined where S_k(n) is defined as the smallest integer for which n|S_k(n)^k. The Smarandache S_k(n) function can therefore be obtained ...
Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...
The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...
If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...
1 ... 8|9|10|11|12|13|14 ... 422 Previous Next

...