Maths Olympiad Prep

Library / /10 of 37

Combinatorics Difficulty 6.4 National olympiad Find the answer

Let P1P2P24P_1P_2\ldots P_{24} be a regular 2424-sided polygon inscribed in a circle ω\omega with circumference 2424. Determine the number of ways to choose sets of eight distinct vertices from these 2424 such that none of the arcs has length 33 or 88.

A number or a short expression. Spacing and $ signs are ignored.

Solution

Let P1P2P24 P_1P_2\ldots P_{24} be a regular 24-sided polygon inscribed in a circle ω\omega 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 3n3n vertices and selecting nn vertices such that no two selected vertices are 3 or nn apart. Label the vertices 1,2,,3n1, 2, \ldots, 3n and group them into sets of three: {1,n+1,2n+1}\{1, n+1, 2n+1\}, {2,n+2,2n+2}\{2, n+2, 2n+2\}, and so on until {n,2n,3n}\{n, 2n, 3n\}. Since we need to select nn vertices, one from each group, the condition that no two vertices are nn apart is automatically satisfied.

Next, we need to ensure that no two selected vertices are 3 apart. Let ana_n denote the number of ways to select nn vertices with the given properties. Clearly, a1=0a_1 = 0 because each vertex is three apart from itself. For a2a_2, we manually compute that there are 6 valid sets.

To find a general formula, we construct a recursion relation. Initially, there are 32n13 \cdot 2^{n-1} ways to select nn 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 n1n-1 vertices, leading to the recursion relation:
an=32n1an1. a_n = 3 \cdot 2^{n-1} - a_{n-1}.

To solve this, we derive a closed form. From the recursion relation, we get:
an+1=32nan. a_{n+1} = 3 \cdot 2^n - a_n.
Subtracting the first equation from the second and simplifying, we obtain:
an+1=32n1+an1. a_{n+1} = 3 \cdot 2^{n-1} + a_{n-1}.
Further manipulation yields:
anan+1=2an1. a_n - a_{n+1} = -2a_{n-1}.
Rearranging and shifting indices, we find:
an=an1+2an2. a_n = a_{n-1} + 2a_{n-2}.

The characteristic polynomial of this recurrence relation has roots 2 and -1, giving us the general solution:
an=A2n+B(1)n. a_n = A \cdot 2^n + B(-1)^n.
Using the initial conditions a1=0a_1 = 0 and a2=6a_2 = 6, we determine the constants AA and BB:
A=1,B=2. A = 1, \quad B = 2.
Thus, the closed form is:
an=2n+2(1)n. a_n = 2^n + 2(-1)^n.

For n=8n = 8, we have:
a8=28+2(1)8=256+2=258. a_8 = 2^8 + 2(-1)^8 = 256 + 2 = 258.

The answer is: \boxed{258}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.