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 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+…+bn−1bn+bnbn+1<n−2004.
This one wants a proof. Work it on paper, read the official solution, then mark
yourself honestly — the ladder only means something if the record is true.
Official solution
Given the sequences of points An on the positive half of the y-axis and Bn on the curve y=2x with the condition ∣OAn∣=∣OBn∣=n1, we need to prove two statements.
1. an>an+1>4 for all n∈N. 2. There exists n0∈N such that for any n>n0, b1b2+b2b3+…+bnbn+1<n−2004.
### Part 1: Proving an>an+1>4
1. **Determine Coordinates of An and Bn**: - An=(0,n1) - Bn=(bn,2bn) - Given ∣OBn∣=n1, we have: bn2+2bn=n21⟹bn=1+n21−1
2. **Find the x-intercept an of the line AnBn**: - The slope of the line AnBn is: slope=bn−02bn−n1=bn2bn−n1 - The equation of the line is: y−n1=(bn2bn−n1)x - Setting y=0 to find the x-intercept an: 0−n1=(bn2bn−n1)an⟹−n1=(bn2bn−n1)an an=2bn−n1bn=1−2n2bnbn(1+n2bn)=n2bn1+n2bn
3. **Sum cn**: Sn=c1+c2+⋯+cn - Let n=2k−2 for some positive integer k≥2: Sn>31+41+⋯+2k−11+2k1 =(2+11+221)+(22+11+231)+⋯+(2k−1+11+2k1) >2⋅221+22⋅231+⋯+2k−1⋅2k1=2k−1
4. **Set n0**: - If we set n0=24009−2, then for all n>n0: (1−b1b2)+(1−b2b3)+⋯+(1−bnbn+1)=Sn>Sn0>24009−1=2004 b1b2+b2b3+⋯+bn−1bn+bnbn+1<n−2004
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.