Given two integers satisfying Let be a regular polygon. Denote by the set of its vertices. Find the number of convex polygon whose vertices belongs to and exactly has two acute angles.
Solution
Given two integers and satisfying , let be a regular polygon. Denote by the set of its vertices. We aim to find the number of convex -gons whose vertices belong to and have exactly two acute angles.
Notice that if a regular -gon has exactly two acute angles, they must be at consecutive vertices. Otherwise, there would be two disjoint pairs of sides that take up more than half of the circle each. Assume that the last vertex, clockwise, of these four vertices that make up two acute angles is fixed; this reduces the total number of regular -gons by a factor of , and we will later multiply by this factor.
Suppose the larger arc that the first and the last of these four vertices make contains points, and the other arc contains points. For each , the vertices of the -gon on the smaller arc may be arranged in ways, and the two vertices on the larger arc may be arranged in ways (so that the two angles cut off more than half of the circle).
The total number of polygons given by is thus . Summation over all and change of variable gives that the total number of polygons (divided by a factor of ) is:
This can be proven to be exactly by double induction on and . The base cases and are readily calculated. The induction step is:
So the total number of -gons is:
The answer is: \boxed{(2n + 1) \left[ \binom{n}{m - 1} + \binom{n + 1}{m - 1} \right]}.