Browse · MathNet
PrintCroatia_2018
Croatia 2018 counting and probability
Problem
We say that a circular arrangement of positive integers is alternating if every number is either smaller, or larger than both of its neighbours. We call a pair of adjacent numbers good if, upon its removal, the remaining numbers form an alternating arrangement.
The numbers to are placed on a circle in an alternating arrangement. Determine the least possible number of good pairs of adjacent numbers in such arrangement.
The numbers to are placed on a circle in an alternating arrangement. Determine the least possible number of good pairs of adjacent numbers in such arrangement.
Solution
Let , , and be four consecutive numbers in an alternating arrangement. Assume . Then and .
The pair is not good if and only if . Therefore, we conclude that is not good if and only if is the largest, and the smallest number of the quadruple .
If is not good, then is, because is greater than or equal to . Furthermore, is good because is not greater than .
This shows that, of any two pairs sharing an element, at least one is a good pair. We conclude that there are at least good pairs.
Assume that there is an alternating arrangement in which there are exactly good pairs.
Without loss of generality, we can assume that , and that is not a good pair. Then are both good, while the pair is not, for any . We also notice that cannot be a good pair.
Since is not good, we conclude that . Similarly, since is not good, we get . Continuing this way, we get thus arriving at a contradiction. This shows that it is impossible to have exactly good pairs. Therefore, there must be at least of them.
An example of an alternating arrangement containing exactly good pairs is .
The pair is not good if and only if . Therefore, we conclude that is not good if and only if is the largest, and the smallest number of the quadruple .
If is not good, then is, because is greater than or equal to . Furthermore, is good because is not greater than .
This shows that, of any two pairs sharing an element, at least one is a good pair. We conclude that there are at least good pairs.
Assume that there is an alternating arrangement in which there are exactly good pairs.
Without loss of generality, we can assume that , and that is not a good pair. Then are both good, while the pair is not, for any . We also notice that cannot be a good pair.
Since is not good, we conclude that . Similarly, since is not good, we get . Continuing this way, we get thus arriving at a contradiction. This shows that it is impossible to have exactly good pairs. Therefore, there must be at least of them.
An example of an alternating arrangement containing exactly good pairs is .
Final answer
151
Techniques
Coloring schemes, extremal arguments