Mark B. Villarino 2026-11-05
Mark B. Villarino wrote an elementary classification argument for Archimedean solids using Euler formula for a sphere. His paper proves the thirteen exceptional convex cases, treating prisms and antiprisms as separate infinite families.[ref]
On the Archimedean or Semiregular Polyhedra by Mark B. Villarino. Original byline, abstract and sections 1.2 and 5
The counting argument relates the faces meeting at a vertex to a global constraint on vertices, edges and faces. This makes a short topological identity constrain possible three-dimensional shapes. The classification must specify its convexity and vertex-uniformity assumptions to avoid including different notions of semiregularity.
Past exam of the mathematics course of the University of Cambridge 2004 ib Paper 3 3G Solution Created 2026-09-24 Updated 2026-10-14
The Euler formula for a sphere, applied to the surface of a convex polyhedron, is . In a regular polyhedron let be the common number of edges incident at a vertex. Counting vertex-edge and face-edge incidences, pentagonal faces give and . Hencewhose right-hand side can be positive only if . Thus . Substitution then yields , provingThese are the counts of the dodecahedron. Here regular polyhedron is understood in the convex, ordinary-face sense used by the stated Euler formula; self-intersecting star constructions do not share these hypotheses.
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 3 5F a Solution Created 2026-09-24 Updated 2026-10-06
For a finite triangulation of a surface of the sphere, Euler formula for a sphere iswhere , and count vertices, edges and triangular faces. Since each face has three edges and each edge borders two faces, also .
Past exam of the mathematics course of the University of Cambridge 2016 ib Paper 3 5F b Solution Created 2026-09-24 Updated 2026-10-06
Let and count the pentagonal and hexagonal faces. Counting incidences of edges with vertices and faces givesThe Euler formula for a sphere also applies to this polygonal decomposition: triangulating a polygon by adding one diagonal increases both and by one, preserving . Substitution givesThus there are exactly 12 pentagons, independently of the number of hexagons.