Search Results for ""

The Barth sextic is a sextic surface in complex three-dimensional projective space having the maximum possible number of ordinary double points, namely 65. The surface was ...

A bicubic graph is a bipartite cubic graph. Tutte (1971) conjectured that all 3-connected bicubic graphs are Hamiltonian (the Tutte conjecture), but a number of bicubic ...

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 ...

Borsuk conjectured that it is possible to cut an n-dimensional shape of generalized diameter 1 into n+1 pieces each with diameter smaller than the original. It is true for ...

Consider n strings, each oriented vertically from a lower to an upper "bar." If this is the least number of strings needed to make a closed braid representation of a link, n ...

Given a chord PQ of a circle, draw any other two chords AB and CD passing through its midpoint. Call the points where AD and BC meet PQ X and Y. Then M is also the midpoint ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

A circumhyperbola is a circumconic that is a hyperbola. A rectangular circumhyperbola always passes through the orthocenter H and has center on the nine-point circle ...

A coincidence is a surprising concurrence of events, perceived as meaningfully related, with no apparent causal connection (Diaconis and Mosteller 1989). Given a large number ...

The line R[s]=1/2 in the complex plane on which the Riemann hypothesis asserts that all nontrivial (complex) Riemann zeta function zeros lie. The plot above shows the first ...