Maths Olympiad Prep

Library / /1324 of 1394

, 2020

Combinatorics Difficulty 6.1 National Olympiad Prove it United States

Problem:

Farmer James wishes to cover a circle with circumference 10π10\pi with six different types of colored arcs. Each type of arc has radius 55, has length either π\pi or 2π2\pi, and is colored either red, green, or blue. He has an unlimited number of each of the six arc types. He wishes to completely cover his circle without overlap, subject to the following conditions:
- Any two adjacent arcs are of different colors.
- Any three adjacent arcs where the middle arc has length π\pi are of three different colors.
Find the number of distinct ways Farmer James can cover his circle. Here, two coverings are equivalent if and only if they are rotations of one another. In particular, two colorings are considered distinct if they are reflections of one another, but not rotations of one another.

Solution

Solution:

Fix an orientation of the circle, and observe that the problem is equivalent to finding the number of ways to color ten equal arcs of the circle such that each arc is one of three different colors, and any two arcs which are separated by exactly one arc are of different colors. We can consider every other arc, so we are trying to color just five arcs so that no two adjacent arcs are of the same color. This is independent from the coloring of the other five arcs.

Let aia_{i} be the number of ways to color ii arcs in three colors so that no two adjacent arcs are the same color. Note that a1=3a_{1}=3 and a2=6a_{2}=6. We claim that ai+ai+1=32ia_{i}+a_{i+1}=3 \cdot 2^{i} for i2i \geq 2. To prove this, observe that aia_{i} counts the number of ways to color i+1i+1 points in a line so that no two adjacent points are the same color, and the first and (i+1)(i+1)th points are the same color. Meanwhile, ai+1a_{i+1} counts the number of ways to color i+1i+1 points in a line so that no two adjacent points are the same color, and the first and (i+1)(i+1)th points are different colors. Then ai+ai+1a_{i}+a_{i+1} is the number of ways to color i+1i+1 points in a line so that no two adjacent points are the same color. There are clearly 32i3 \cdot 2^{i} ways to do this, as we pick the colors from left to right, with 33 choices for the first color and 22 for the rest. We then compute a3=6a_{3}=6, a4=18a_{4}=18, a5=30a_{5}=30. Then we can color the whole original circle by picking one of the 3030 possible colorings for each of the two sets of 55 alternating arcs, for 302=90030^{2}=900 total.

Now, we must consider the rotational symmetry. If a configuration has no rotational symmetry, then we have counted it 1010 times. If a configuration has 180180^{\circ} rotational symmetry, then we have counted it 55 times. This occurs exactly when we have picked the same coloring from our 3030 for both choices, and in exactly one particular orientation, so there are 3030 such cases. Having 7272^{\circ} or 3636^{\circ} rotational symmetry is impossible, as arcs with exactly one arc between them must be different colors. Then after we correct for overcounting our answer is

9003010+305=93 \frac{900-30}{10}+\frac{30}{5}=93

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.