Maths Olympiad Prep

Library / /980 of 1394

, 2016

Geometry Difficulty 5.5 AIME, harder Prove it United States

Problem:

Let S={(x,y)x,yZ,0x,y2016}S=\{(x, y) \mid x, y \in \mathbb{Z}, 0 \leq x, y \leq 2016\}. Given points A=(x1,y1)A=(x_1, y_1), B=(x2,y2)B=(x_2, y_2) in SS, define
d2017(A,B)=(x1x2)2+(y1y2)2(mod2017) d_{2017}(A, B) = (x_1 - x_2)^2 + (y_1 - y_2)^2 \pmod{2017}

The points A=(5,5)A=(5,5), B=(2,6)B=(2,6), C=(7,11)C=(7,11) all lie in SS. There is also a point OSO \in S that satisfies
d2017(O,A)=d2017(O,B)=d2017(O,C) d_{2017}(O, A) = d_{2017}(O, B) = d_{2017}(O, C)

Find d2017(O,A)d_{2017}(O, A).

Solution

Solution:

Note that the triangle is a right triangle with right angle at AA. Therefore,
R2=(72)2+(116)24=252=(25)(21)1021(mod2017). R^2 = \frac{(7-2)^2 + (11-6)^2}{4} = \frac{25}{2} = (25)\left(2^{-1}\right) \equiv 1021 \pmod{2017}.
(An equivalent approach works for general triangles; the fact that the triangle is right simply makes the circumradius slightly easier to compute.)

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.