Search Results for ""

The dual polyhedron of the small icosihemidodecahedron U_(49) and Wenninger dual W_(89). When rendered, the small icosihemidodecacron and small dodecahemidodecacron appear ...

For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...

The small rhombicuboctahedral graph is a quartic graph on 24 nodes and 48 edges that corresponds to the skeleton of the small rhombicuboctahedron. It has graph diameter 5, ...

Taking a connected graph or network with a high graph diameter and adding a very small number of edges randomly, the diameter tends to drop drastically. This is known as the ...

The dual polyhedron of the small rhombidodecahedron and Wenninger model W_(74).

The weak law of large numbers (cf. the strong law of large numbers) is a result in probability theory also known as Bernoulli's theorem. Let X_1, ..., X_n be a sequence of ...

The dual polyhedron of the small dodecahemicosahedron U_(62) and Wenninger dual W_(100). When rendered, the small dodecahemicosacron and great dodecahemicosacron appear the ...

The dual polyhedron of the small dodecicosahedron U_(50) and Wenninger dual W_(90).

The dual polyhedron of the small rhombihexahedron U_(18) and Wenninger dual W_(86)

A "law of large numbers" is one of several theorems expressing the idea that as the number of trials of a random process increases, the percentage difference between the ...