{"id":1264,"date":"2015-02-01T01:00:19","date_gmt":"2015-02-01T01:00:19","guid":{"rendered":"http:\/\/blogs.ams.org\/visualinsight\/?p=1264"},"modified":"2015-07-29T00:47:44","modified_gmt":"2015-07-29T00:47:44","slug":"pentagon-decagon-packing","status":"publish","type":"post","link":"https:\/\/blogs.ams.org\/visualinsight\/2015\/02\/01\/pentagon-decagon-packing\/","title":{"rendered":"Pentagon-Decagon Packing"},"content":{"rendered":"<div align=\"center\">\n<div id=\"attachment_1267\" style=\"width: 506px\" class=\"wp-caption alignnone\"><a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/01\/pentagon_decagon_packing_egan.png\"><img loading=\"lazy\" decoding=\"async\" aria-describedby=\"caption-attachment-1267\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/01\/pentagon_decagon_packing_egan.png\" alt=\"Pentagon-Decagon Packing - Greg Egan\" width=\"500\" height=\"344\" class=\"size-full wp-image-1267\" srcset=\"https:\/\/blogs.ams.org\/visualinsight\/files\/2015\/01\/pentagon_decagon_packing_egan.png 500w, https:\/\/blogs.ams.org\/visualinsight\/files\/2015\/01\/pentagon_decagon_packing_egan-300x206.png 300w\" sizes=\"auto, (max-width: 500px) 100vw, 500px\" \/><\/a><p id=\"caption-attachment-1267\" class=\"wp-caption-text\">Pentagon-Decagon Packing &#8211; Greg Egan<\/p><\/div>\n<\/div>\n<p>Two regular pentagons and a regular decagon meet snugly at a vertex: their interior angles sum to 360&deg;.  However, they can&#8217;t tile the plane.  However, they come fairly close, as shown in this picture by <a href=\"http:\/\/www.gregegan.net\">Greg Egan<\/a>.  <\/p>\n<p>Say we have three regular polygons with \\(p, q,\\) and \\(r\\) sides, respectively.  Their interior angles will sum to 360&deg; if and only if<\/p>\n<p>$$   \\frac{1}{p} + \\frac{1}{q} + \\frac{1}{r}  = \\frac{1}{2} $$<\/p>\n<p>So, two regular pentagons and a regular decagon can meet snugly at a vertex because<\/p>\n<p>$$  \\frac{1}{5} + \\frac{1}{5} + \\frac{1}{10}  = \\frac{1}{2} $$<\/p>\n<p>In fact there are 10 solutions of the equation <\/p>\n<p>$$   \\frac{1}{p} + \\frac{1}{q} + \\frac{1}{r}  = \\frac{1}{2} $$<\/p>\n<p>for natural numbers \\(p, q, \\) and \\(r\\), not counting the order.  Of these, only 4 give tilings of the plane by regular polygons.  The other 6 are &#8216;forbidden&#8217;.<\/p>\n<p>Here are all 10 solutions:<\/p>\n<ol>\n<li>\n$$  \\frac{1}{6} + \\frac{1}{6} + \\frac{1}{6}  = \\frac{1}{2} $$<br \/>\ngives the regular <a href=\"http:\/\/en.wikipedia.org\/wiki\/Hexagonal_tiling\">hexagonal tiling<\/a>.\n<\/li>\n<p><li>\n$$  \\frac{1}{5} + \\frac{1}{5} + \\frac{1}{10}  = \\frac{1}{2} $$<br \/>\ndoes not give a tiling by regular polygons, but it gives the packing shown above, and three more described by <a href=\"http:\/\/gruze.org\/tilings\/5_5_10_broken_roses\">Robert Fathauer<\/a>.<\/p>\n<div align=\"center\">\n<a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_5_5_10.png\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_5_5_10.png\" alt=\"Regular Polygons Meeting at Vertex: 5.5.10\" width=\"200\" height=\"243\" class=\"alignnone size-full wp-image-1368\" \/><\/a>\n<\/div>\n<\/li>\n<p><li>\n$$  \\frac{1}{4} + \\frac{1}{8} + \\frac{1}{8}  = \\frac{1}{2} $$<br \/>\ngives the semiregular <a href=\"http:\/\/en.wikipedia.org\/wiki\/Truncated_square_tiling\">truncated square tiling<\/a>.\n<\/li>\n<p><li>\n$$  \\frac{1}{4} + \\frac{1}{6} + \\frac{1}{12}  = \\frac{1}{2} $$<br \/>\ngives the semiregular <a href=\"http:\/\/en.wikipedia.org\/wiki\/Truncated_trihexagonal_tiling\">truncated trihexagonal tiling<\/a>.\n<\/li>\n<p><li>\n$$  \\frac{1}{4} + \\frac{1}{5} + \\frac{1}{20}  = \\frac{1}{2} $$<br \/>\ndoes not give a tiling by regular polygons, but it gives a packing described by <a href=\"http:\/\/gruze.org\/tilings\/compass\">Robert Fathauer<\/a>.<\/p>\n<div align=\"center\">\n<a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_4_5_20.png\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_4_5_20.png\" alt=\"Regular Polygons Meeting at Vertex: 4.5.20\" width=\"201\" height=\"240\" class=\"alignnone size-full wp-image-1369\" \/><\/a>\n<\/div>\n<\/li>\n<p><li>\n$$  \\frac{1}{3} + \\frac{1}{12} + \\frac{1}{12}  = \\frac{1}{2} $$<br \/>\ngives the semiregular <a href=\"http:\/\/en.wikipedia.org\/wiki\/Truncated_hexagonal_tiling\">truncated hexagonal tiling<\/a>.\n<\/li>\n<p><li>\n$$  \\frac{1}{3} + \\frac{1}{10} + \\frac{1}{15}  = \\frac{1}{2} $$<br \/>\ndoes not give a tiling by regular polygons, but it gives two packings described by <a href=\"http:\/\/gruze.org\/tilings\/3_10_15_fighters\">Robert Fathauer<\/a> and <a href=\"http:\/\/gruze.org\/tilings\/nutshell\">Kevin Jardine<\/a>.<\/p>\n<div align=\"center\">\n<a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_3_3_10_15.png\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_3_3_10_15.png\" alt=\"Regular Polygons Meeting at Vertex: 3.10.15\" width=\"180\" height=\"240\" class=\"alignnone size-full wp-image-1362\" \/><\/a><\/div>\n<\/li>\n<p><li>\n$$  \\frac{1}{3} + \\frac{1}{9} + \\frac{1}{18}  = \\frac{1}{2} $$<br \/>\ndoes not give a tiling by regular polygons, but it gives a packing described by <a href=\"http:\/\/gruze.org\/tilings\/3_9_18_art\">Robert Fathauer<\/a>.<\/p>\n<div align=\"center\">\n<a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_3_3_9_18.svg_.png\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_3_3_9_18.svg_.png\" alt=\"Regular Polygons Meeting at Vertex: 3.9.18\" width=\"200\" height=\"278\" class=\"alignnone size-full wp-image-1366\" \/><\/a>\n<\/div>\n<\/li>\n<p><li>\n$$  \\frac{1}{3} + \\frac{1}{8} + \\frac{1}{24}  = \\frac{1}{2} $$<br \/>\ndoes not give a tiling by regular polygons, but it gives two packings discovered by <a href=\"http:\/\/gruze.org\/tilings\/dancer\">Robert Fathauer<\/a> and <a href=\"http:\/\/gruze.org\/tilings\/milkmaid\">Kevin Jardine<\/a>.<\/p>\n<div align=\"center\">\n<a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_3_8_24.png\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_3_8_24.png\" alt=\"Regular Polygons Meeting at Vertex: 3.8.24\" width=\"200\" height=\"258\" class=\"alignnone size-full wp-image-1371\" \/><\/a>\n<\/div>\n<\/li>\n<p><li>\n$$  \\frac{1}{3} + \\frac{1}{7} + \\frac{1}{42} = \\frac{1}{2} $$<br \/>\ndoes not give a tiling by regular polygons, but it gives a packing discovered by <a href=\"http:\/\/gruze.org\/tilings\/3_7_42_shield\">Robert Fathauer<\/a>.<\/p>\n<div align=\"center\">\n<a href=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_3_7_42.png\"><img loading=\"lazy\" decoding=\"async\" src=\"http:\/\/blogs.ams.org\/visualinsight\/files\/2015\/02\/Regular_polygons_meeting_at_vertex_3_7_42.png\" alt=\"Regular Polygons Meeting at Vertex: 3.7.42\" width=\"200\" height=\"230\" class=\"alignnone size-full wp-image-1367\" \/><\/a>\n<\/div>\n<\/li>\n<\/ol>\n<p>Because 42 is the largest number appearing in the above list of solutions, this number&#8212;or twice this number&#8212;appears in <a href=\"http:\/\/en.wikipedia.org\/wiki\/Hurwitz%27s_automorphisms_theorem\">Hurwitz&#8217;s automorphism theorem<\/a>.  This says that the number of orientation-preserving conformal transformations of a compact Riemann surface of genus \\(g &gt; 1\\) is at most \\(84(g \u2212 1)\\).  For more on this, see:<\/p>\n<p>&bull; John Baez, <a href=\"http:\/\/math.ucr.edu\/home\/baez\/42.html\">42<\/a>.<\/p>\n<p>For more on the 6 &#8216;forbidden tilings&#8217;&mdash;the 6 solutions on the list above that do not give tilings of the plane by regular polygons&mdash;see this set of webpages:<\/p>\n<p>&bull; Kevin Jardine, <a href=\"http:\/\/gruze.org\/tilings\/imperfect_congruence\">Imperfect congruence: Kepler, D&uuml;rer and the mystery of the forbidden tilings<\/a>.<\/p>\n<p>Also see:<\/p>\n<p>&bull; <a href=\"http:\/\/en.wikipedia.org\/wiki\/Tiling_by_regular_polygons\">Tiling by regular polygons<\/a>, Wikipedia.<\/p>\n<p>The above pictures of the 6 forbidden tilings were created by <a href=\"http:\/\/en.wikipedia.org\/wiki\/User:Dllu\">dllu<\/a> and placed on <a href=\"http:\/\/commons.wikimedia.org\/wiki\/File:Regular_polygons_meeting_at_vertex_3_5_5_10.svg\">Wikimedia Commons<\/a> under a <a href=\"http:\/\/creativecommons.org\/publicdomain\/zero\/1.0\/deed.en\"> Creative Commons CC0 1.0 Universal Public Domain Dedication<\/a> copyright.<\/p>\n<hr \/>\n<p><i>Visual Insight<\/i> is a place to share striking images that help explain advanced topics in mathematics. I\u2019m always looking for truly beautiful images, so if you know about one, please drop a comment <a href=\"http:\/\/blogs.ams.org\/visualinsight\/about-visual-insight\/\">here<\/a> and let me know!<\/p>\n<div style=\"margin-top: 0px; margin-bottom: 0px;\" class=\"sharethis-inline-share-buttons\" ><\/div>","protected":false},"excerpt":{"rendered":"<p>Two regular pentagons and a regular decagon meet snugly at a vertex: their interior angles sum to 360&deg;.  However, they can&#8217;t tile the plane.  However, they come fairly close, as shown in this picture by <a href=\"http:\/\/www.gregegan.net\">Greg Egan<\/a>.  <\/p>\n<div style=\"margin-top: 0px; margin-bottom: 0px;\" class=\"sharethis-inline-share-buttons\" data-url=https:\/\/blogs.ams.org\/visualinsight\/2015\/02\/01\/pentagon-decagon-packing\/><\/div>\n","protected":false},"author":66,"featured_media":1267,"comment_status":"open","ping_status":"closed","sticky":true,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[2,17,7],"tags":[],"class_list":["post-1264","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-images-library","category-packings","category-tilings"],"jetpack_featured_media_url":"https:\/\/blogs.ams.org\/visualinsight\/files\/2015\/01\/pentagon_decagon_packing_egan.png","jetpack_shortlink":"https:\/\/wp.me\/p42Vmc-ko","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/1264","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/users\/66"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/comments?post=1264"}],"version-history":[{"count":31,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/1264\/revisions"}],"predecessor-version":[{"id":1272,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/posts\/1264\/revisions\/1272"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/media\/1267"}],"wp:attachment":[{"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/media?parent=1264"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/categories?post=1264"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.ams.org\/visualinsight\/wp-json\/wp\/v2\/tags?post=1264"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}