Maths Olympiad Prep

Library / /914 of 1394

, 2020

Algebra Difficulty 5.4 AIME, harder Prove it United States

Problem:
Let {ai}i0\{a_{i}\}_{i \geq 0} be a sequence of real numbers defined by
an+1=an21220202n1 a_{n+1} = a_{n}^2 - \frac{1}{2^{2020 \cdot 2^{n}} - 1}
for n0n \geq 0. Determine the largest value for a0a_{0} such that {ai}i0\{a_{i}\}_{i \geq 0} is bounded.

Solution

Solution:
Let a0=122020(t+1t)a_{0} = \frac{1}{\sqrt{2}^{2020}}\left(t + \frac{1}{t}\right), with t1t \geq 1. (If a0<122018a_{0} < \frac{1}{\sqrt{2}^{2018}} then no real tt exists, but we ignore these values because a0a_{0} is smaller.) Then, we can prove by induction that
an=1220202n(t2n+1t2n). a_{n} = \frac{1}{\sqrt{2}^{2020 \cdot 2^{n}}}\left(t^{2^{n}} + \frac{1}{t^{2^{n}}}\right) .
For this to be bounded, it is easy to see that we just need
t2n220202n=(t22020)2n \frac{t^{2^{n}}}{\sqrt{2}^{2020 \cdot 2^{n}}} = \left(\frac{t}{\sqrt{2}^{2020}}\right)^{2^{n}}
to be bounded, since the second term approaches 00. We see that this is equivalent to t22020/2t \leq 2^{2020 / 2}, which means
a0122020(22020+(12)2020)=1+122020 a_{0} \leq \frac{1}{\sqrt{2}^{2020}}\left(\sqrt{2}^{2020} + \left(\frac{1}{\sqrt{2}}\right)^{2020}\right) = 1 + \frac{1}{2^{2020}}

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.