Search Results for ""

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

The smallI icosicosidodecahedron is the uniform polyhedron with Maeder index 31 (Maeder 1997), Wenninger index 71 (Wenninger 1989), Coxeter index 40 (Coxeter et al. 1954), ...

A submodule S of a module M such that for any proper submodule T of M, the submodule generated by S union T is not the entire module M. S is also called superfluous submodule.

An algorithm for computing an Egyptian fraction.

The dual polyhedron of the truncated great dodecahedron U_(37) and Wenninger dual W_(75).

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

The diameter of a polygon is the largest distance between any pair of vertices. In other words, it is the length of the longest polygon diagonal (e.g., straight line segment ...

According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...

The convex hulls of the small cubicuboctahedron U_(13), small rhombihexahedron U_(18), and stellated truncated hexahedron U_(19) are all the Archimedean small ...

The largest n such that |z_n|<4 in a Mandelbrot set. Points of different count are often assigned different colors.