Last Tuesday I gave a talk at the Berkeley Math Circle titled “All About (regular) n-gons”. This was a sort of problem seminar that covered a mixed bag of mathematical tricks, but one focus was the use of complex numbers in geometry.

You can download my handout here. The questions range from fairly basic geometry to research questions—the question “How many intersection points are formed when we draw all the diagonals of a regular -gon?” is much more difficult than it appears at first; it was first answered in closed form by Poonen and Rubenstein in 1997.

There was a follow-up problem session this morning, which discussed some of the harder questions. (though I have yet to see solutions to either of the Miklós Schweitzer problems) I was impressed to see more than half a dozen students, many of them in junior high, spend two hours on Saturday morning like this.

The last time I talked at Berkeley Math Circle was in 2002, on generating functions.

Here are some of the more fun problems from my session this week:

- What are all the values of for which you can tile the plane with regular -gons of varying size?
- (Romania 1995) Find the number of ways of coloring the vertices of a regular -gon with colors, such that no two adjacent vertices have the same color.
- Does there exist a regular -gon such that exactly half of its diagonals are parallel to one of its sides?
- Show that the sum of the squares of the lengths of all sides and diagonals emanating from a vertex of a regular -gon inscribed in the unit circle is .
- (USAMO 1997) To
*clip*a convex -gon means to choose a pair of consecutive sides , and to replace them with three segments , , , where is the midpoint of and is the midpoint of . In other words, one cuts off the triangle to obtain a convex -gon. A regular hexagon of area is clipped to obtain a heptagon . Then is clipped (in one of the seven possible ways) to obtain an octagon and so on. Prove that no matter how the clippings are done, the area of is greater than for all . - (USAMO 2008) Let be a convex polygon with sides, . Any set of diagonals that do not intersect in the interior of a polygon determine a
*triangulation*of into triangles. If is regular and there is a triangulation of consisting only of isoceles triangles, find all possible values of .