Skip to main content
OlympiadHQ

Browse · MathNet

Print

62nd Ukrainian National Mathematical Olympiad

Ukraine geometry

Problem

Let's consider on the Cartesian plane all pairs of distinct points , each of which has both integer coordinates. Among these pairs of points, find all those for which there exist two distinct points with both integer coordinates, such that quadrilateral is convex and inscribed. A quadrilateral is called convex if both of its diagonals lie inside the quadrilateral.
Solution
First, we will show that for points that are at a distance of from each other, there are no points that satisfy the condition. Indeed, let us assume that such points exist. Then, , which means that at least one of these angles is not less than . Therefore, at least one of the points must lie inside or on the circle with diameter , but this circle does not contain any other integer points except for and .

Now, let's show that for all other pairs of points, such a pair can be found. Let and . If and , then we can take and , and

will be a rectangle, which means that it is inscribed. Otherwise, without loss of generality, we can assume that , and and , where . Without loss of generality, we can also assume that . Then, it is sufficient to take the following points: and . It is easy to see that the segments and intersect at the point , and , so the quadrilateral is indeed inscribed.
Final answer
All pairs of distinct lattice points except those at unit distance apart; for distance 1 no such points exist, and for any other distance such points can be found.

Techniques

Cyclic quadrilateralsInscribed/circumscribed quadrilaterralsCartesian coordinatesRadical axis theoremConstructions and loci