Let $n$ be an integer greater than $1$. Define \[x_1 = n, y_1 = 1, x_{i+1} =\left[ \frac{x_i+y_i}{2}\right] , y_{i+1} = \left[ \frac{n}{x_{i+1}}\right], \qquad \text{for }i = 1, 2, \ldots\ ,\] where $[z]$ denotes the largest integer less than or equal to $z$. Prove that \[ \min \{x_1, x_2, \ldots, x_n \} =[ \sqrt n ]\]
Problem
Source:
Tags: algebra, recurrence relation, Sequence, equation, floor function, IMO Shortlist
30.06.2018 07:11
Can somebody provide a solution ?
30.06.2018 07:22
very inteligent problem
30.06.2018 16:23
First of all, it is clear that $x_i \ge \lfloor \sqrt{n}\rfloor$ for all $n$ since \[x_{i+1}=\left\lfloor \frac{x_i+y_i}{2}\right\rfloor=\left\lfloor \frac{x_i+\lfloor \frac{n}{x_i}\rfloor}{2}\right\rfloor=\left\lfloor \frac{\lfloor x_i+\frac{n}{x_i}\rfloor}{2}\right\rfloor \ge \left\lfloor \frac{\lfloor 2\sqrt{n}\rfloor}{2}\right\rfloor \ge \lfloor \lfloor \sqrt{n}\rfloor\rfloor=\lfloor \sqrt{n}\rfloor\]using $x+\frac{n}{x} \ge 2\sqrt{n}$ and $\lfloor 2x \rfloor \ge 2\lfloor x\rfloor$. So suppose the claim was false. Then $x_i>\sqrt{n}$ for all $n$. But then $y_i \le \frac{n}{x_i}<\sqrt{n}<x_i$ for all $i$. Hence $x_{i+1} \le \frac{x_i+y_i}{2}<x_i$ so that the sequence $(x_i)$ is strictly decreasing. But that of course is impossible since $x_1=n$ then implies $x_n \le 1<\sqrt{n}$. Done.
04.09.2018 16:26
But that of course is impossible since $x_1=n$ then implies $x_n \le 1<\sqrt{n}$. Done. Can you explain the last sentence please and the ideas behind the problem.
04.09.2018 18:40
Ad455 wrote: But that of course is impossible since $x_1=n$ then implies $x_n \le 1<\sqrt{n}$. Done. Can you explain the last sentence please and the ideas behind the problem. Well, we have an integer sequence $x_n$ with $x_1=n$ which is strictly decreasing. Hence $x_2 \le n-1, x_3 \le n-2$ etc. until finally $x_n \le 1$. But then since $1<\sqrt{n}$ this is a contradiction to our assumption that $x_i>\sqrt{n}$ holds for all $i$.
09.09.2018 01:00
Thank you so much Tintarn