Browse · MathNet
PrintThe 35th Japanese Mathematical Olympiad
Japan algebra
Problem
For an integer , a sequence of integers is called a beautiful sequence if the following conditions are all satisfied. . There exists an integer such that and . * For all integers with , the inequality holds. Let be the maximum possible length of a beautiful sequence. For beautiful sequences of length , determine the minimum possible value of . Here, the length of a sequence of integers is .
Solution
Let be a beautiful sequence of length . Take an integer such that . Then since . We first prove . Let be an integer with . By applying the third condition to , we obtain which implies If , repeatedly applying this inequality gives and hence . If , we have and \quad (*) and so we obtain $n \le 13$.
Let $n = 13$. Then the above argument shows $n > m$. From $(*)$, we have 2025 \ge (2^{m-1} - 1)2^{n-m-1} = 2^{n-2} - 2^{n-m-1} = 2^{11} - 2^{12-m}, which implies $2^{12-m} \ge 23$, and hence $2^{12-m} \ge 32$. Therefore, a_n = a_m + (a_n - a_m) \ge a_m + 2^{n-m-1} = 2025 + 2^{12-m} \ge 2057. Thus, we have $a_n \ge 2057$ when $n = 13$.
Finally, we show that the sequence (a_1, a_2, \dots, a_{13}) = (0, 1033, 1545, 1801, 1929, 1993, 2025, 2041, 2049, 2053, 2055, 2056, 2057) (a_{13} - a_1, a_{13} - a_2, \dots, a_{13} - a_{12}) = (2057, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1), so for all integers $t$ with $1 \le t \le 11$, we have $a_{13} - a_t \ge 2(a_{13} - a_{t+1})$. Therefore, for all integers $1 \le i < j < k \le 13$, we have $a_1, a_2, \dots, a_{13}a_{13}$ is 2057.
Final answer
N = 13; minimum a_N = 2057
Techniques
Recurrence relationsLinear and quadratic inequalities