Maths Olympiad Prep

Library / February /26 of 62

February, 2017

Combinatorics Difficulty 5.1 AIME, harder Find the answer United States

Problem:

Jeffrey writes the numbers 11 and 100000000=108100000000=10^{8} on the blackboard. Every minute, if x,yx, y are on the board, Jeffrey replaces them with
x+y2 and 2(1x+1y)−1 \frac{x+y}{2} \text{ and } 2\left(\frac{1}{x}+\frac{1}{y}\right)^{-1}

After 20172017 minutes the two numbers are aa and bb. Find min⁡(a,b)\min (a, b) to the nearest integer.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:

Note that the product of the integers on the board is a constant. Indeed, we have that
x+y2⋅2(1x+1y)−1=xy \frac{x+y}{2} \cdot 2\left(\frac{1}{x}+\frac{1}{y}\right)^{-1}=x y
Therefore, we expect that the answer to the problem is approximately 1⋅108=104\sqrt{1 \cdot 10^{8}}=10^{4}.
To be more rigorous, we have to show that the process indeed converges quickly enough. To show this, we bound the difference between the integers on the board at time ii. Say that at time ii, the integers on the board are ai<bia_{i}<b_{i}. Note that
di+1=bi+1−ai+1=ai+bi2−2(1ai+1bi)−1=(ai−bi)22(ai+bi)<bi−ai2=di2 \begin{aligned} d_{i+1}=b_{i+1}-a_{i+1}= & \frac{a_{i}+b_{i}}{2}-2\left(\frac{1}{a_{i}}+\frac{1}{b_{i}}\right)^{-1}=\frac{\left(a_{i}-b_{i}\right)^{2}}{2\left(a_{i}+b_{i}\right)} \\ & <\frac{b_{i}-a_{i}}{2}=\frac{d_{i}}{2} \end{aligned}
The inequality at the end follows from that obvious fact that bi−ai<bi+aib_{i}-a_{i}<b_{i}+a_{i}. Therefore, di+1≤di2d_{i+1} \leq \frac{d_{i}}{2}, so d2017<10822017d_{2017}<\frac{10^{8}}{2^{2017}}, which is extremely small. So the difference is essentially 00 at time 20172017, which completes the argument.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.