4. First say the 2n words of the form |
1, a, a2, ..., an-1, b, ba, ba2, ..., ban-1 |
are canonical words. |
Now we show that any word can be reduced to one of these canonical words
by applications of the relations |
Using |
Next, |
With this, w is equivalent to biaj. Finally,
i can be reduced to 0 or 1, and j to |
Return to Symmetries of Regular Polygons Exercises.