Search Results for ""

n weighings are sufficient to find a bad coin among (3^n-1)/2 coins (Steinhaus 1999, p. 61). vos Savant (1993) gives an algorithm for finding a bad ball among 12 balls in ...

A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...

A cylindrical projection of points on a unit sphere centered at O consists of extending the line OS for each point S until it intersects a cylinder tangent to the sphere at ...

The dodecadodecahedron is the uniform polyhedron with Maeder index 36 (Maeder 1997), Wenninger index 73 (Wenninger 1989), Coxeter index 45 (Coxeter et al. 1954), and Har'El ...

The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...

Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...

The great cubicuboctahedron is the uniform polyhedron with Maeder index 14 (Maeder 1997), Wenninger index 77 (Wenninger 1989), Coxeter index 50 (Coxeter et al. 1954), and ...

The great dirhombicosidodecahedron is the uniform polyhedron with Maeder index 75 (Maeder 1997), Wenninger index 119 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), ...

The great ditrigonal dodecicosidodecahedron is the uniform polyhedron with Maeder index 42 (Maeder 1997), Wenninger index 81 (Wenninger 1989), Coxeter index 54 (Coxeter et ...

2023-08-30 The great ditrigonal icosidodecahedron is the uniform polyhedron with Maeder index 47 (Maeder 1997), Wenninger index 87 (Wenninger 1989), Coxeter index 58 (Coxeter ...