MathLabs

Problem 1

Consider the following operation on positive real numbers written on a blackboard: choose a number rr written on the blackboard, erase that number, and then write a pair of positive real numbers aa and bb satisfying 2r2=ab2r^2=ab on the board. Assume that you start out with just one positive real number rr on the blackboard, and apply this operation k2−1k^2-1 times to end up with k2k^2 positive real numbers, not necessarily distinct. Show that there exists a number on the board which does not exceed krkr.
Step 1 of 4: Estimate one replacement
1a2+1b2=a2+b2a2b2≥2aba2b2=1r2\frac1{a^2}+\frac1{b^2}=\frac{a^2+b^2}{a^2b^2}\ge\frac{2ab}{a^2b^2}=\frac1{r^2}
Detailed analysis

For a replacement r by a,b with ab=2r^2, AM–GM gives 1/a^2+1/b^2=(a^2+b^2)/(a^2b^2)≥2ab/(a^2b^2)=1/r^2.