Maths Olympiad Prep

Library / /17 of 42

Geometry Difficulty 5.4 AIME, harder Prove it Ireland

Let AOBAOB be a triangle with AOB=90\angle AOB = 90^\circ. Define a sequence of points X1,X2,X3,,X2022X_1, X_2, X_3, \dots, X_{2022} as follows:
* X1X_1 lies on the ray OA\vec{OA} with OX1=1|OX_1| = 1.
* X2X_2 lies on the ray OB\vec{OB} with X1X2=2|X_1X_2| = 2
* For 3n20223 \le n \le 2022, the XnX_n lie alternately on OA\vec{OA} (nn odd) or OB\vec{OB} (nn even), with Xn1Xn=n|X_{n-1}X_n| = n.
Find the distance X2020X2022|X_{2020}X_{2022}|.

Solution

Let X0=OX_0 = O and, for 0n20220 \le n \le 2022, let dn=OXnd_n = |OX_n|. Then d0=0d_0 = 0 and by Pythagoras' theorem, for n1n \ge 1

Figure 1

d2n12+d2n2=(2n)2 d_{2n-1}^2 + d_{2n}^2 = (2n)^2
d2n12+d2n22=(2n1)2. d_{2n-1}^2 + d_{2n-2}^2 = (2n-1)^2.
Subtracting these equations we get d2n2d2n22=(2n)2(2n1)2=4n1d_{2n}^2 - d_{2n-2}^2 = (2n)^2 - (2n-1)^2 = 4n-1.
Since d02=0d_0^2 = 0 we then have
d2n2=k=1nd2k2d2k22=k=1n4k1=4k=1nkk=1n1=2n(n+1)n=n(2n+1). d_{2n}^2 = \sum_{k=1}^{n} d_{2k}^2 - d_{2k-2}^2 = \sum_{k=1}^{n} 4k - 1 = 4 \sum_{k=1}^{n} k - \sum_{k=1}^{n} 1 \\ = 2n(n+1) - n = n(2n+1).
This implies that:
d20202=10102021=2041210 d_{2020}^2 = 1010 \cdot 2021 = 2041210
d20222=10112023=2045253 d_{2022}^2 = 1011 \cdot 2023 = 2045253
and so X2020X2022=20452532041210|X_{2020}X_{2022}| = \sqrt{2045253} - \sqrt{2041210}.

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.