Problem:
A positive integer is infallible if it is possible to select vertices of a regular 100-gon so that they form a convex, non-self-intersecting -gon having all equal angles. Find the sum of all infallible integers between 3 and 100, inclusive.
Problem:
A positive integer is infallible if it is possible to select vertices of a regular 100-gon so that they form a convex, non-self-intersecting -gon having all equal angles. Find the sum of all infallible integers between 3 and 100, inclusive.
Solution:
Suppose is an equiangular -gon formed from the vertices of a regular 100-gon. Note that the angle is determined only by the number of vertices of the 100-gon between and . Thus in order for to be equiangular, we require exactly that are equally spaced and are equally spaced. If is odd, then all the vertices must be equally spaced, meaning . If is even, we only need to be able to make a regular -gon from the vertices of a 100-gon, which we can do if . Thus the possible values of are , and , for a total of .