TOPICS
Search

Search Results for ""


2391 - 2400 of 4217 for Strong Lawof Small NumbersSearch Results
There are a number of attractive polyhedron compounds consisting of 12 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of 13 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of 25 octahedra. These compounds will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of 30 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of 35 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...
There are a number of attractive polyhedron compounds consisting of six octahedra. The two illustrated above can be constructed as the duals of cube 6-compounds. These ...
There are a number of attractive polyhedron compounds consisting of seven octahedra. The compound illustrated above can be constructed as the dual of cube 7-compound. The ...
There are a number of attractive polyhedron compounds consisting of nine octahedra. The compound illustrated above can be constructed as the dual of cube 9-compound. The ...
The number of nondecreasing lists {a_1,a_2,...,a_n} consisting of n elements 1<=a_i<=k is given by the binomial coefficient N(n,k)=(n+k-1; n-1). For example, there are six ...
The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...
1 ... 237|238|239|240|241|242|243 ... 422 Previous Next

...