Maths Olympiad Prep

Library / /3 of 64

Geometry Difficulty 7.4 National olympiad, round 2 Find the answer

Given that AA, BB, and CC are noncollinear points in the plane with integer coordinates
such that the distances ABAB, ACAC, and BCBC are integers, what is the smallest possible value of ABAB?

A number or a short expression. Spacing and $ signs are ignored.

Solution

The smallest distance is 3, achieved by A=(0,0)A = (0,0), B=(3,0)B = (3,0), C=(0,4)C = (0,4).
To check this, it suffices to check that ABAB cannot equal 1 or 2. (It cannot equal 0
because if two of the points were to coincide, the three points would be collinear.)

The triangle inequality implies that ACBCAB|AC - BC| \leq AB, with equality if and only if A,B,CA,B,C
are collinear. If AB=1AB = 1, we may assume without loss of generality that A=(0,0)A = (0,0), B=(1,0)B = (1,0).
To avoid collinearity, we must have AC=BCAC = BC, but this forces C=(1/2,y)C = (1/2, y) for some y\RRy \in \RR,
a contradiction. (One can also treat this case by scaling by a factor of 2 to reduce to the case AB=2AB=2,
treated in the next paragraph.)

If AB=2AB = 2, then we may assume without loss of generality that A=(0,0),B=(2,0)A = (0,0), B = (2,0).
The triangle inequality implies ACBC{0,1}|AC - BC| \in \{0,1\}.
Also, for C=(x,y)C = (x,y), AC2=x2+y2AC^2 = x^2 + y^2 and BC2=(2x)2+y2BC^2 = (2-x)^2 + y^2 have the same parity;
it follows that AC=BCAC = BC. Hence c=(1,y)c = (1,y) for some y\RRy \in \RR, so y2y^2 and y2+1=BC2y^2+1=BC^2
are consecutive perfect squares. This can only happen for y=0y = 0, but then A,B,CA,B,C are collinear,
a contradiction again.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.