Convex triangle-square polygons

Consider an infinite supply of cardboard equilateral triangles and squares, all of them with side length of one inch.  With these pieces, we desire to form convex polygons of different sides.  It is trivial to come up with this kind of polygons for sides 3, 4, 5 and 6.

  • Construct examples of these convex polygons for sides 7, 8, 9 and 10.
  • Can you construct an 11-side convex polygon with these pieces?
  • What would be the convex polygon with the largest number of sides that you could construct with these pieces?

Before we go ahead and construct the polygons, let us try to find as much information as possible:

  • The interior angles of a polygon with n sides add up to 180n - 360.
  • By construction, all the convex angles at the exterior vertices of the planar graphs can only be one of the following: 60^\circ, 90^\circ, 120^\circ, and 150^\circ. Although technically possible, we should not count the flat angle 180^\circ as a possibility, since the occurrence of such angle indicates the presence of an “extended edge.”If we have a, b and c interior angles of respectively 60^\circ, 90^\circ and 120^\circ at the exterior vertices of the polygon, and of course n-a-b-c interior angles of 150^\circ at the same vertices, then it must be
    60a + 90b + 120c + 150(n-a-b-c) = 180n - 360,

    which reduces to

    3a + 2b + c + n = 12.

    This is a very strong statement! It indicates, among other things, that such polygons cannot have more than 12 sides! This answers the third question of our puzzle.

    Incidentally, it will also help us find examples of constructions. For example, for the seven-sided polygon, a choice of angles that works for me is a=0, b=2 and c=1 (that is: no 60^\circ angles, two right angles, only one angle of 120^\circ and four angles of 150^\circ.

    For the case n=11, there is only one possibility: a=0, b=0, c=1; that is, only one angle of 120^\circ, and ten angles of 150^\circ. Will this allow us to construct the 11-sided convex polygon? The answer is yes, but to come up with an example, you may need to make use of some 180^\circ angles.

    I have included a list with a set of choices of angles, for polygons of sides n=7,8,9,10,11,12 for which I was able to find a valid construction:

    n 60^\circ–angles 90^\circ–angles 120^\circ–angles 150^\circ–angles Planar graph
    7 0 2 1 4
    8 0 0 4 4
    9 0 0 3 6
    10 0 0 2 8
    11 0 0 1 10
    12 0 0 0 12

    Feel free to construct the corresponding polygons, and fill in the table.


Although not strictly necessary, at some point during the exploration of this problem I used other facts about planar graphs that came in handy to help construct my examples. The most notable of those appear below:

  • Each n-sided convex polygon that we construct by putting together these triangles and squares form a planar graph with V vertices (V \geq n), E edges (E \geq n) and F faces (F \geq 1).  These planar graphs all have Euler characteristic 1, and thus V - E + F =1.
  • Assume we are able to construct a n-sided polygon by using x triangles (according to the statement above, there should be F-x squares). By adding all the involved angles, we obtain
    \underbrace{3 \cdot 60 \cdot x}_{\text{triangles}} + \underbrace{4 \cdot 90 \cdot (F-x)}_{\text{squares}} = \underbrace{180n - 360}_{\text{polygon}} + \underbrace{360 (V-n)}_{\text{interior vertices}},

    which reduces to

    n - x = 2(V-1-F).

    In particular, this indicates that x and n have the same parity.

  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: