17
$\begingroup$

Let $n$ be a positive integer. Suppose we have an equilateral polygon in the Euclidean plane with the property that all angles except possibly two consecutive ones are an integral multiple of $\frac{\pi}{n}$, then all angles are an integral multiple of $\frac{\pi}{n}$.

This problem is #28 on page 61 in these notes restated here for convenience: http://websites.math.leidenuniv.nl/algebra/ant.pdf

I have seen a number-theoretic proof of this. I was wondering if there are any geometric (or at least non number-theoretic) proofs of this result.

  • 0
    "regular polygon" is the more standard terminology... :)2010-11-23
  • 2
    @JM: Not quite. It is only implied that the polygon has equal sides, not equal angles. Also the problem is almost verbatim from the notes, so not my words.2010-11-23
  • 0
    Ah, so we can't assume the polygon is convex? This should be very interesting...2010-11-23
  • 0
    Hmm, I'm missing something... this problem is equivalent to proving that the only elements of $\mathbb{Z}[e^{2\pi i/n}]$ with unit norm are the nth roots of unity, right? But isn't that known to be false for n > 6?2011-03-01
  • 0
    @user7530, I don't see the equivalence you claim.2011-05-16
  • 0
    I was trying to solve the following issue: Find the number of possible closed paths using one fifth of an arc (72 degrees), where at each time step we can move either clockwise or anti-clockwise. in that particular problem, it was assumed that the number of arcs should be 70. In my solution, I assumed that all closed paths have no loops. I then proved that the number of arcs should necessarilly be even in order to get a closed path. Then, I simplified the problem to finding the number of possible EQUILATERAL POLYGONS, with interior angles: 72, 2*72, 3*72, and 4*72. To do this I needed to find2011-05-16

1 Answers 1

2

Maybe this is a start: Given: an n-step walk in the plane with each step of length 1 that begins with a step to (1,0) and ends at the origin, and all angles between steps being a multiple of $\pi/n$ except perhaps those between three adjacent steps (i.e. two corners). Show that all the angles are multiples of $\pi/n$.

Label the angles by $\{\alpha_k|1\le k \le n\}$ with the angles that are not multiples of $\pi/n$ being $\alpha_{n-1}$ and $\alpha_n$. Define each consecutive step in vector form, that is, relative to this coordinate system. We have steps of form:
$$(\cos(\beta_k),\sin(\beta_k))$$
where $\beta_k = \Sigma_{j\le k}\;\alpha_j$ and $\beta_1=0$. So $\beta_k$ is a multiple of $\pi/n$ except for $k=n-1$ or $n$.

That the path returns to the origin requires:
$$\Sigma_k(\cos(\beta_k),\sin(\beta_k)) = (0,0).$$
Now note that $\cos(k\pi/n)$ can be written as a polynomial over $Z$ in $\cos(\pi/n)$ and that $\sin(k\pi/n)$ can be written as $\sin(\pi/n)$ times a polynomial over $Z$ in $\cos(\pi/n)$. These apply to all the $\beta_k$ except the last two.

So it looks like a problem in $Z[\cos(\pi/n)]$. And maybe you should divide the "y" restriction by $\sin(\pi/n)$.