Browse · MathNet
Print25th Turkish Mathematical Olympiad
Turkey algebra
Problem
Let be a non-decreasing sequence of positive integers. Suppose that and the subsequence contains exactly 25 distinct positive integers. Show that Find the total number of such sequences in the case of equality.
Solution
Let us solve more general problem: Let be a non-decreasing sequence of positive integers. Suppose that and the subsequence contains exactly distinct positive integers. Show that Since the sequence is non-decreasing we have for . On the other hand, implies . Hence for we obtain
Summing up the last inequality for side by side, we get Since the set includes distinct elements, we have It follows that Now (2) and (3) prove the required inequality. In the case of equality, we must have and for all Since we get . For a , since the difference between two consecutive terms can be at most 1. Furthermore, since +1 increases can not be in the neighbouring consecutive pairs. On the other hand, all conditions are satisfied if +1 increases are not in the neighbouring consecutive pairs. Therefore we need to count all possible places of +1 increases. Corresponding indices of the sequence can be in between 2 and and hence there are possibilities. Total number of +1 increases is . This problem is equivalent to placing identical balls into boxes such that there are no neighbouring boxes both including a ball. The answer is for , and 0 otherwise. In our case the answer is .
Summing up the last inequality for side by side, we get Since the set includes distinct elements, we have It follows that Now (2) and (3) prove the required inequality. In the case of equality, we must have and for all Since we get . For a , since the difference between two consecutive terms can be at most 1. Furthermore, since +1 increases can not be in the neighbouring consecutive pairs. On the other hand, all conditions are satisfied if +1 increases are not in the neighbouring consecutive pairs. Therefore we need to count all possible places of +1 increases. Corresponding indices of the sequence can be in between 2 and and hence there are possibilities. Total number of +1 increases is . This problem is equivalent to placing identical balls into boxes such that there are no neighbouring boxes both including a ball. The answer is for , and 0 otherwise. In our case the answer is .
Final answer
binom(1992, 23)
Techniques
Sums and productsLinear and quadratic inequalitiesRecursion, bijection