CombinatoricsDifficulty 5.1AIME, harderFind the answerUnited States
Problem:
Jeffrey writes the numbers 1 and 100000000=108 on the blackboard. Every minute, if x,y are on the board, Jeffrey replaces them with 2x+y and 2(x1+y1)−1
After 2017 minutes the two numbers are a and b. Find 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 2x+y⋅2(x1+y1)−1=xy Therefore, we expect that the answer to the problem is approximately 1⋅108=104. 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 i. Say that at time i, the integers on the board are ai<bi. Note that di+1=bi+1−ai+1=2ai+bi−2(ai1+bi1)−1=2(ai+bi)(ai−bi)2<2bi−ai=2di The inequality at the end follows from that obvious fact that bi−ai<bi+ai. Therefore, di+1≤2di, so d2017<22017108, which is extremely small. So the difference is essentially 0 at time 2017, which completes the argument.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.