Maths Olympiad Prep

Library / India — Team Selection Test /21 of 77

India — Team Selection Test

Geometry Difficulty 5.4 AIME, harder Prove it India

Let (a0,a1,a2,...)(a_0, a_1, a_2, ...) and (b0,b1,b2,...)(b_0, b_1, b_2, ...) be two infinite sequences of integers such that
(an−an−1)(an−an−2)+(bn−bn−1)(bn−bn−2)=0, (a_n - a_{n-1})(a_n - a_{n-2}) + (b_n - b_{n-1})(b_n - b_{n-2}) = 0,
for all integers n≥2n \ge 2. Prove that there exists a positive integer KK such that
aK+2011=aK+(2011)2011. a_{K+2011} = a_{K+(2011)^{2011}}.

Solution

Consider points Pj=(aj,bj)P_j = (a_j, b_j) in the plane. The slope of the lines PnPn−1P_nP_{n-1} and PnPn−2P_nP_{n-2} are
r=bn−bn−1an−an−1,s=bn−bn−2an−an−2, r = \frac{b_n - b_{n-1}}{a_n - a_{n-1}}, \quad s = \frac{b_n - b_{n-2}}{a_n - a_{n-2}},
respectively. The given condition implies that rs=−1rs = -1. Hence it follows that the lines PnPn−1P_nP_{n-1} and PnPn−2P_nP_{n-2} are perpendicular to each other. This implies that PnP_n lies on the circle CnC_n with diameter Pn−1Pn−2P_{n-1}P_{n-2}. Let f(n)=∣Pn−1−Pn−2∣2f(n) = |P_{n-1} - P_{n-2}|^2. Then f(n)f(n) is an integer. The observation that PnP_n lies on the circle CnC_n shows that f(n)≤f(n−1)f(n) \le f(n-1). Thus we get a non-increasing sequence of positive integers. This must be constant after certain stage. Thus f(n)f(n) is constant for n≥Nn \ge N, for some positive integer NN. This implies that the diameter of CnC_n is constant for all n≥Nn \ge N. Hence CnC_n are all equal circles for n≥Nn \ge N. This implies that Pn=Pn+2P_n = P_{n+2} for all n≥Nn \ge N. But then an=an+2a_n = a_{n+2} for all n≥Nn \ge N. Hence
aN+2011=aN+(2011)2011. a_{N+2011} = a_{N+(2011)^{2011}}.

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.