Maths Olympiad Prep

Library / /2 of 2

Geometry Difficulty 5.7 AIME, harder Prove it United States

Problem:

Two sets of points in the coordinate plane are given: {(1,1),(1,2),,(1,2000)}\{(-1,1),(-1,2), \ldots,(-1,2000)\} and {(1,1),(1,2),,(1,2000)}\{(1,1),(1,2), \ldots,(1,2000)\}. 20002000 line segments are drawn connecting these points so that each point in the first set is connected to exactly one point in the second set, and vice versa. Find, with proof, the sum of the yy-intercepts of the segments.

Solution

Solution:

Note that, for any real numbers aa and bb, the segment connecting (1,a)(-1, a) and (1,b)(1, b) has midpoint (0,a+b2)\left(0, \frac{a+b}{2}\right), so its yy-intercept is a+b2\frac{a+b}{2}. Now suppose that our given segments connect (1,1)(-1,1) to (1,y1)\left(1, y_{1}\right), (1,2)(-1,2) to (1,y2)\left(1, y_{2}\right), (1,3)(-1,3) to (1,y3)\left(1, y_{3}\right), \ldots, (1,2000)(-1,2000) to (1,y2000)\left(1, y_{2000}\right). The sum of the yy-intercepts is then

1+y12+2+y22+3+y32++2000+y20002=12[(1+2+3++2000)+(y1+y2+y3++y2000)]\frac{1+y_{1}}{2}+\frac{2+y_{2}}{2}+\frac{3+y_{3}}{2}+\cdots+\frac{2000+y_{2000}}{2}=\frac{1}{2}\left[(1+2+3+\cdots+2000)+\left(y_{1}+y_{2}+y_{3}+\cdots+y_{2000}\right)\right].

But it follows from the given that y1,y2,,y2000y_{1}, y_{2}, \ldots, y_{2000} are just some reordering of 1,2,,20001,2, \ldots, 2000, so our sum simplifies to
12[(1+2+3++2000)+(1+2+3++2000)]=1+2+3++2000 \frac{1}{2}[(1+2+3+\cdots+2000)+(1+2+3+\cdots+2000)]=1+2+3+\cdots+2000
By the formula for the sum of an arithmetic progression, this equals 20002001/2=2,001,0002000 \cdot 2001 / 2 = 2,001,000.

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 reproduced verbatim; metadata (topic, difficulty) added by this project.