On the Cartesian coordinate system Oxy, consider a sequence of points An(xn,yn) in which (xn)n=1∞,(yn)n=1∞ are two sequences of positive numbers satisfying the following conditions: xn+1=2xn2+xn+22,yn+1=(2yn+yn+2)2∀n≥1 Suppose that O,A1,A2016 belong to a line d and A1,A2016 are distinct. Prove that all the points A2,A3,…,A2015 lie on one side of d.
Solution
From O,A1,A2016 are collinear, there exists some positive number k such that y1x1=y2016x2016=k>0. We shall prove that for all i=2,2015, yixi>k. Indeed, Notice that xn+1=2xn2+xn+22⇔xn+12=2xn2+xn+22, which implies that (xn2) forms an arithmetic sequence. Hence, for all i=2,2015, let αi=20152016−i,βi=2015i−1 then αi+βi=1, 2≤i≤2015 and xi2=αix12+βix20162⇔xi=αix12+βix20162. Similarly, we also have yi=(αiy1+βiy2016)2 and kyi=(αix1+βix2016)2. We need to prove αix12+βix20162>(αix1+βix2016)2 for all 2≤i≤2015(∗). By applying the Cauchy-Schwarz inequality, we have (αi+βi)(αix12+βix20162)≥(αix1+βix2016)2=((αi+βi)(αix1+βix2016))2≥(αix1+βix2016)4 So the inequality (∗) is true for each 2≤i≤2015. Since all points are distinct, then A1=A2016⇔x1=x2016, so equality does not occur in (∗). So all the points A2,A3,…,A2015 belong to the same side with respect to d.
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.