Search Results for ""
321 - 330 of 4217 for Strong Lawof Small NumbersSearch Results
A zero-symmetric graph is a vertex-transitive cubic graph whose edges are partitioned into three orbits by its automorphism group. The figures above show some small ...
A kit consisting of colored rods and slotted balls that can be used to construct three-dimensional configurations. The balls into which the rods are placed resemble an ...
An alternating permutation is an arrangement of the elements c_1, ..., c_n such that no element c_i has a magnitude between c_(i-1) and c_(i+1) is called an alternating (or ...
A digit sum s_b(n) is a sum of the base-b digits of n, which can be implemented in the Wolfram Language as DigitSum[n_, b_:10] := Total[IntegerDigits[n, b]]The following ...
Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...
The gyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating one of the pentagonal cupolas of a small rhombicosidodecahedron by 1/10 of a turn. It is ...
The metabigyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating two of the pentagonal cupolas of a small rhombicosidodecahedron located in the ...
The metabigyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating two of the pentagonal cupolas of a small rhombicosidodecahedron located in the ...
The trigyrate rhombicosidodecahedron is a convex equilateral solid obtained by rotating three of the pentagonal cupolas of a small rhombicosidodecahedron by 1/10 of a turn ...
Zero is the integer denoted 0 that, when used as a counting number, means that no objects are present. It is the only integer (and, in fact, the only real number) that is ...
...
View search results from all Wolfram sites (41045 matches)

