In a planar rectangular coordinate system, a sequence of points {An} on the positive half of the y-axis and a sequence of points {Bn} on the curve y=2x (x≥0) satisfy the condition ∣OAn∣=∣OBn∣=n1. The x-intercept of line segment AnBn is an, and the x-coordinate of point Bn is bn, n∈N. Prove that
(1) an>an+1>4, n∈N;
(2) There is n0∈N, such that for any n>n0, b1b2+b2b3+⋯+bn0−1bn0+bnbn+1<n−2004.
Solution
(1) According to the stated conditions we have An(0,n1), and Bn(bn,2bn) (bn>0). From ∣OBn∣=n1 we get bn2+2bn=(n1)2. Thus, bn=(n1)2+1−1,n∈N.
Since 2n2bn=1−n2bn2>0, we have bn+2=n2bn1 and an=1−2n2bnbn(1+n2bn)=1−(1−n2bn2)bn(1+n2bn)=n2bn1+n2bn2=bn+2+2(bn+2). Thus, an=(n1)2+1+1+2(n1)2+1+2. Since n1>n+11>0, an>an+1>4 for any n∈N.
(2) Let cn=1−bnbn+1 for n∈N, then cn=(n1)2+1−1(n1)2+1−(n+11)2+1=n2[n21−(n+1)21]⋅(n1)2+1+(n+11)2+1(n1)2+1+1>(n+1)22n+121+2(n1)2+11>2(n+1)22n+1. Since (2n+1)(n+2)−2(n+1)2=n>0, we obtain cn>n+21,n∈N. Let Sn=c1+c2+⋯+cn,n∈N. If n=2k−2>1 (k∈N), then Sn>31+41+⋯+2k−11+2k1=(31+41)+[22+11+⋯+231]+⋯+[2k−1+11+⋯+2k1]>2⋅221+22⋅231+⋯+2k−1⋅2k1=2k−1. Therefore, if we put n0=24009−2, then for any n>n0 we have [1−b1b2]+[1−b2b3]+⋯+[1−bnbn+1]=Sn>Sn0>24009−1=2004. Consequently, \frac{b_2}{b_1} + \frac{b_3}{b_2} + \cdots + \frac{b_n}{b_{n-1}} + \frac{b_{n+1}}{b_n} < n - 2004, \quad n > n_0.
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 and solution reproduced as published; topic and difficulty added by this site.