Browse · MathNet
Print37th Hellenic Mathematical Olympiad 2020
Greece 2020 counting and probability
Problem
We write circles in a line and in their interior we write the numbers from to , as follows:
We color each circle with one of the two colors: red (R) and green (G). We say that a coloring is «good», if the following happens: The number of red circles in the first part of numbers from to is greater than the number of the red circles existing in the second part from number to .
a. Determine how many different colorings can be constructed.
b. Determine how many different “good” colorings can be constructed.
(Note: Two colorings are different, if they have different colors at least in one circle.)
a. Determine how many different colorings can be constructed.
b. Determine how many different “good” colorings can be constructed.
(Note: Two colorings are different, if they have different colors at least in one circle.)
Solution
(a) Each circle can be colored with two different colors independently of the coloring of the other circles. Therefore, according to the multiplicative principle, the different colorings are
(b) We consider the coloring , where is the number of red circles among to , and is the number of red circles among to . The coloring is «good» if , whereas the coloring is no good if .
Let be the set of «good» colorings and the set of “no good” colorings. We will prove that each element of the set corresponds to an element of and vice versa.
Indeed, if is in , then . By changing the color of each circle, we find the coloring which belongs to , because
Conversely, if is in , then . By changing the color of each circle, we find the coloring which belongs to the set because
Therefore, between the sets and there exists a - correspondence and so the two sets have the same number of elements, that is, each of them has
(b) We consider the coloring , where is the number of red circles among to , and is the number of red circles among to . The coloring is «good» if , whereas the coloring is no good if .
Let be the set of «good» colorings and the set of “no good” colorings. We will prove that each element of the set corresponds to an element of and vice versa.
Indeed, if is in , then . By changing the color of each circle, we find the coloring which belongs to , because
Conversely, if is in , then . By changing the color of each circle, we find the coloring which belongs to the set because
Therefore, between the sets and there exists a - correspondence and so the two sets have the same number of elements, that is, each of them has
Final answer
a) 2^99; b) 2^98
Techniques
Enumeration with symmetryRecursion, bijection