Let be a regular -sided polygon inscribed in a circle with circumference . Determine the number of ways to choose sets of eight distinct vertices from these such that none of the arcs has length or .
Solution
Let be a regular 24-sided polygon inscribed in a circle with circumference 24. We aim to determine the number of ways to choose sets of eight distinct vertices from these 24 such that none of the arcs has length 3 or 8.
We generalize the problem by considering a regular polygon with vertices and selecting vertices such that no two selected vertices are 3 or apart. Label the vertices and group them into sets of three: , , and so on until . Since we need to select vertices, one from each group, the condition that no two vertices are apart is automatically satisfied.
Next, we need to ensure that no two selected vertices are 3 apart. Let denote the number of ways to select vertices with the given properties. Clearly, because each vertex is three apart from itself. For , we manually compute that there are 6 valid sets.
To find a general formula, we construct a recursion relation. Initially, there are ways to select vertices, ignoring the condition that no two vertices can be 3 apart. However, this count overestimates the number of valid sets. The overcount is equal to the number of valid sets of vertices, leading to the recursion relation:
To solve this, we derive a closed form. From the recursion relation, we get:
Subtracting the first equation from the second and simplifying, we obtain:
Further manipulation yields:
Rearranging and shifting indices, we find:
The characteristic polynomial of this recurrence relation has roots 2 and -1, giving us the general solution:
Using the initial conditions and , we determine the constants and :
Thus, the closed form is:
For , we have:
The answer is: \boxed{258}.