Problem:
Call a polygon normal if it can be inscribed in a unit circle. How many non-congruent normal polygons are there such that the square of each side length is a positive integer?
Problem:
Call a polygon normal if it can be inscribed in a unit circle. How many non-congruent normal polygons are there such that the square of each side length is a positive integer?
Solution:
The side lengths of the polygon can only be from the set , which take up of the circle respectively. By working modulo degrees we see that must be used an even number of times. We now proceed to casework on the longest side of the polygon.
Case 1: If the longest side has length , then the remaining sides must contribute the remaining degrees. There are possibilities: .
Case 2: If the longest side has length , then it takes up either or of the circle. In the former case we have possibilities: . In the latter case there is only possibility: .
Case 3: If the longest side has length , then it shows up either twice or four times. In the former case we have possibilities: . In the latter case there is only possibility: .
Case 4: If all sides have length , then there is possibility: .
Adding up all cases, we have polygons.