Given that , , and are noncollinear points in the plane with integer coordinates
such that the distances , , and are integers, what is the smallest possible value of ?
Solution
The smallest distance is 3, achieved by , , .
To check this, it suffices to check that 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 , with equality if and only if
are collinear. If , we may assume without loss of generality that , .
To avoid collinearity, we must have , but this forces for some ,
a contradiction. (One can also treat this case by scaling by a factor of 2 to reduce to the case ,
treated in the next paragraph.)
If , then we may assume without loss of generality that .
The triangle inequality implies .
Also, for , and have the same parity;
it follows that . Hence for some , so and
are consecutive perfect squares. This can only happen for , but then are collinear,
a contradiction again.