Search Results for ""
1831 - 1840 of 3987 for Lawof Large NumbersSearch Results
Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...
If the integral coefficients C_0, C_1, ..., C_(N-1) of the polynomial f(x)=C_0+C_1x+C_2x^2+...+C_(N-1)x^(N-1)+x^N are divisible by a prime number p, while the free term C_0 ...
Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...
A smooth map f:S^1->R^3 whose image has singularities. In particular, in the theory of Vassiliev's knot invariants, singular knots with a finite number of ordinary double ...
If {a_0,a_1,...} is a recursive sequence, then the set of all k such that a_k=0 is the union of a finite (possibly empty) set and a finite number (possibly zero) of full ...
The small snub icosicosidodecahedral graph is the skeleton of the small retrosnub icosicosidodecahedron and small snub icosicosidodecahedron. It is illustrated above in a ...
The number of regions into which space can be divided by n mutually intersecting spheres is N=1/3n(n^2-3n+8), giving 2, 4, 8, 16, 30, 52, 84, ... (OEIS A046127) for n=1, 2, ...
A number of attractive 20-compounds of the regular tetrahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...
A number of attractive 24-compounds of the regular tetrahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...
A number of attractive 26-compounds of the regular tetrahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...
...
View search results from all Wolfram sites (41452 matches)

