Browse · MathNet
PrintTeam Selection Test for IMO 2023
Turkey 2023 counting and probability
Problem
Initially the equation is written on the blackboard. Asli and Zehra alternatively make moves, Asli begins. A person making move replaces one of the stars in the equation with either or . What is the maximal number of real solutions of the obtained equation Asli can guarantee regardless of strategy of Zehra after all the stars have been replaced?
Solution
Answer: 1011.
Let us describe the strategy of Aslı for guaranteeing at least 1011 solutions of the equation. Aslı makes her first move arbitrarily. After that, at each move she chooses any star with already replaced neighbour and replaces this star with the sign of this neighbour. She completes the game with 1011 such moves after her first one. With this strategy, Aslı guarantees the existence of at least 1011 intervals of the form such that the signs in front of both and are the same. In such an interval, by considering the values of arbitrarily close to and , the equation on the board takes both arbitrarily large and arbitrarily small values. Therefore, by the Mean Value Theorem, there is a real root of this equation in this interval and hence Aslı guarantees at least 1011 solutions to this equation.
Now we will describe Zehra's strategy to keep the number of real roots less than 1012. Let us enumerate the stars as 0, 1, 2, ..., 2023. Consider the pairs (0, 2023) and (1, 2), (3, 4), (5, 6), ..., (2021, 2022). Zehra's strategy is the following: For the pair (0, 2023), whenever Aslı puts a sign in one of them, Zehra puts the same sign on the other one. For all the other pairs, whenever Aslı puts a sign in one of them, Zehra puts the opposite sign. We will show that this strategy works.
Firstly we consider the infinite intervals. Without loss of generality, assume that signs of the pair (0, 2023) is . Consider the values . We will start reading all the signs from 2023 to 0. First, we will see a sign in 2023, then for each consecutive terms we read a pair of opposite signs until the last one with a sign. At any set in the range from to 2023 for , we will see more positive terms than negative ones. That's because if is odd, we have pairs of opposite signs with a plus sign at the end, and if is even we have pairs of opposite signs with a plus sign at the end again, making sure that number of plus signs is always at least half of all signs. So, we can assign to each minus sign a plus one appearing later in the equation. Since the terms appearing later has larger absolute value, in these pairings each pair has a positive sum with two positive numbers remaining in hand, which means the function is always positive and there are no real roots. Same argument applies for the other infinite interval.
Now we consider the intervals between the stars numbered for . There are two possible cases based on their signs:
† If the signs of are different, there are no real solutions in the interval . We will show that the equation is either always positive or always negative in this interval. We will start with the following observation.
Lemma 1: For all we have Proof: Let then we need to show that for each we have We know that the product of two positive real numbers with a fixed sum is larger when the numbers are closer. Therefore, smallest value of LHS in this interval is 1 when , while the largest value of the RHS in this interval is when , hence we are done.
Back to the case, we work in the interval and W.L.O.G. assume that the sign of is . Then we can swap the sign appearing in the largest element in the set of stars with the positive signs in the stars numbered and . If there are any signs among the two. If there are less than two signs on one of the ends, we just add new terms, and because the signs are different this will only decrease the value of the function. We perform the same operation for (carrying the signs to the closest two places), then we see that the new function on the blackboard takes values less than the original one for each value of in this interval. Moreover, new function is always positive for the values in this interval, since the 6 consecutive terms appearing in the lemma has positive sum and for all the other terms, just like the argument in the infinite interval claim, all positive terms can be paired up with a negative term having less absolute value (and same for the other part with opposite signs), hence the function is always positive in this interval and have no roots.
Lemma 2: For all we have and Proof: Again we will use the transformation . Then, the first inequality becomes for . We can even prove the stronger statement as since the linear inequality is held in the interval . The second inequality becomes LHS gets its minimum value at , RHS gets its maximum at and when we compare these two values we still get that LHS is greater than the RHS. Now, when we take the derivative we will see that by the lemma above, the value of the derivative is always positive for these 6 consecutive terms and by the same swapping and pairing arguments used previously, the derivative of the function on the blackboard has a value greater than 0 hence the function is strictly increasing (or decreasing) in this interval, hence it must provide exactly 1 root.
Finally, Zehra's strategy shows that there can be at most 1002 real solutions to the equation at the end. That's because there are no real solutions are coming from the infinite intervals, and 1001 among the 2023 finite intervals have opposite signs at its ends thus they provide no solutions as well. This lefts at most 1002 intervals with same signs at both ends where each such interval can provide at most one real solution, bounding the number of real solutions above by 1002. However, at the end, the numerator is a polynomial of degree 2023 since the number of signs are not equal and we will have either or as the leading coefficient after expanding. Since the degree is odd, the number of real roots must be odd, this forces the number of real solutions to be at most 1011 since 1012 real solutions is not possible and this completes the proof.
Let us describe the strategy of Aslı for guaranteeing at least 1011 solutions of the equation. Aslı makes her first move arbitrarily. After that, at each move she chooses any star with already replaced neighbour and replaces this star with the sign of this neighbour. She completes the game with 1011 such moves after her first one. With this strategy, Aslı guarantees the existence of at least 1011 intervals of the form such that the signs in front of both and are the same. In such an interval, by considering the values of arbitrarily close to and , the equation on the board takes both arbitrarily large and arbitrarily small values. Therefore, by the Mean Value Theorem, there is a real root of this equation in this interval and hence Aslı guarantees at least 1011 solutions to this equation.
Now we will describe Zehra's strategy to keep the number of real roots less than 1012. Let us enumerate the stars as 0, 1, 2, ..., 2023. Consider the pairs (0, 2023) and (1, 2), (3, 4), (5, 6), ..., (2021, 2022). Zehra's strategy is the following: For the pair (0, 2023), whenever Aslı puts a sign in one of them, Zehra puts the same sign on the other one. For all the other pairs, whenever Aslı puts a sign in one of them, Zehra puts the opposite sign. We will show that this strategy works.
Firstly we consider the infinite intervals. Without loss of generality, assume that signs of the pair (0, 2023) is . Consider the values . We will start reading all the signs from 2023 to 0. First, we will see a sign in 2023, then for each consecutive terms we read a pair of opposite signs until the last one with a sign. At any set in the range from to 2023 for , we will see more positive terms than negative ones. That's because if is odd, we have pairs of opposite signs with a plus sign at the end, and if is even we have pairs of opposite signs with a plus sign at the end again, making sure that number of plus signs is always at least half of all signs. So, we can assign to each minus sign a plus one appearing later in the equation. Since the terms appearing later has larger absolute value, in these pairings each pair has a positive sum with two positive numbers remaining in hand, which means the function is always positive and there are no real roots. Same argument applies for the other infinite interval.
Now we consider the intervals between the stars numbered for . There are two possible cases based on their signs:
† If the signs of are different, there are no real solutions in the interval . We will show that the equation is either always positive or always negative in this interval. We will start with the following observation.
Lemma 1: For all we have Proof: Let then we need to show that for each we have We know that the product of two positive real numbers with a fixed sum is larger when the numbers are closer. Therefore, smallest value of LHS in this interval is 1 when , while the largest value of the RHS in this interval is when , hence we are done.
Back to the case, we work in the interval and W.L.O.G. assume that the sign of is . Then we can swap the sign appearing in the largest element in the set of stars with the positive signs in the stars numbered and . If there are any signs among the two. If there are less than two signs on one of the ends, we just add new terms, and because the signs are different this will only decrease the value of the function. We perform the same operation for (carrying the signs to the closest two places), then we see that the new function on the blackboard takes values less than the original one for each value of in this interval. Moreover, new function is always positive for the values in this interval, since the 6 consecutive terms appearing in the lemma has positive sum and for all the other terms, just like the argument in the infinite interval claim, all positive terms can be paired up with a negative term having less absolute value (and same for the other part with opposite signs), hence the function is always positive in this interval and have no roots.
Lemma 2: For all we have and Proof: Again we will use the transformation . Then, the first inequality becomes for . We can even prove the stronger statement as since the linear inequality is held in the interval . The second inequality becomes LHS gets its minimum value at , RHS gets its maximum at and when we compare these two values we still get that LHS is greater than the RHS. Now, when we take the derivative we will see that by the lemma above, the value of the derivative is always positive for these 6 consecutive terms and by the same swapping and pairing arguments used previously, the derivative of the function on the blackboard has a value greater than 0 hence the function is strictly increasing (or decreasing) in this interval, hence it must provide exactly 1 root.
Finally, Zehra's strategy shows that there can be at most 1002 real solutions to the equation at the end. That's because there are no real solutions are coming from the infinite intervals, and 1001 among the 2023 finite intervals have opposite signs at its ends thus they provide no solutions as well. This lefts at most 1002 intervals with same signs at both ends where each such interval can provide at most one real solution, bounding the number of real solutions above by 1002. However, at the end, the numerator is a polynomial of degree 2023 since the number of signs are not equal and we will have either or as the leading coefficient after expanding. Since the degree is odd, the number of real roots must be odd, this forces the number of real solutions to be at most 1011 since 1012 real solutions is not possible and this completes the proof.
Final answer
1011
Techniques
Games / greedy algorithms