Let a1,a2,… be a sequence of positive numbers satisfying, for any positive integers k,l,m,n such that k+n=m+l, 1+akanak+an=1+amalam+al. Show that there exist positive numbers b,c so that b≤an≤c for any positive integer n.
Solution
Let Ak+n=1+akanak+an. So for any n, An=1+a1an−1a1+an−1. Consider the function f(x)=1+a1xa1+x where x>0. Since f(x)=a111+a1xa12+a1x=a1+a12xa1(a1+a1x), it follows that f(x)≥{1/a1a1if a1≥1if 0<a1<1. So for any value of a1, there exists 0<t≤1 so that f(x)≥t. (In fact just take t to be the smaller of a1 and 1/a1.) Thus for any n, A(n)≥t and so A2n=An+n=1+an22an≥t∴tan2−2an+t≤0 Thus an lies between the 2 roots of the equation tx2−2x+t=0. The roots are t1±1−t2. Letting b=t1−1−t2 and c=t1+1−t2 and we are done.
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.