Some Unistable Polyhedra

A polyhedral solid with uniform density is unistable (or monostable) if it is stable on exactly one face. Besides these polyhedra, this Demonstration also considers polyhedra as surfaces, skeletons, and as a set of vertices.
In 1968, Guy constructed a unistable polyhedron with 19 faces. It is a kind of truncated prism. Half of its cross section consists of right-angled triangles (see cross section); each of the angles at the coordinate center equals . The construction here allows the first and the last angle to be a little larger, namely ( is called the angle correction), and the others to be a bit smaller. If truncation makes the center of mass fall below the coordinate origin, only the bottom face (see cross section) and possibly two truncated bases are stable. But the last two can be made unstable by making the length of the shortest lateral edge be sufficiently large. In this case, the perpendicular from the center of mass (green line) to the corresponding prism's new basis must not intersect it. So the blue line on the basis and the green line must meet outside of the solid.
For example, to find a unistable polyhedral surface with 15 faces, choose , consider the polyhedron as a set of faces, and set , . To get a unistable polyhedron, its center of mass (red point) must be below the origin (black point). The meaning of the parameters is: , which are the coordinates of intersections of the polyhedron with the axis. So the slope of the blue line is , where is the distance of the origin to the shortest lateral edge of the polyhedron.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


A face of a polyhedron is stable if and only if the orthogonal projection of the center of mass onto the face lies inside the face or on the edge [1, p. 273].
[1] J. Bryant and C. Sangwin, How Round Is Your Circle?: Where Engineering and Mathematics Meet, Princeton: Princeton University Press, 2008 pp. 273–276.
[2] R. K. Guy, A Unistable Polyhedron, Calgary: University of Calgary Department of Mathematics, 1968.
[3] J. H. Conway, M. Goldberg, and R. K. Guy, Problem 66-12, SIAM Review 11, 1969 pp. 78–82.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.

Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-Step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2017 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+