Skip to main content
OlympiadHQ

Browse · MathNet

Print

69th Belarusian Mathematical Olympiad

Belarus geometry

Problem

Call a polygon on a Cartesian plane to be integer if all its vertices are integer. A convex integer 14-gon is cut into integer parallelograms with areas not greater than . Find the minimal possible . (A. Yuran)
Solution
Answer: minimal possible equals .

First we prove two lemmas.

Lemma 1: the given 14-gon has pairs of opposite parallel sides. Since the 14-gon is convex, it suffices to prove that each side has a side parallel to it. Consider an arbitrary side of the given 14-gon. Draw the line perpendicular to and define on this line the direction to the right in such way that the whole 14-gon lies to the right of (it is possible since the 14-gon is convex). Consider a parallelogram with one (left) side lying on and the opposite (right) side lies on another side or inside the 14-gon. If it lies inside the 14-gon, there is another parallelogram , the left side of which intersect the right side of , while the right side of lies on the side or inside the 14-gon. Continue choosing such parallelograms until finally we find the parallelogram , the right side of which lies on some side of the given 14-gon. This side is the required side, parallel to . Lemma 1 is proved.

Call the sequence of the parallelograms, defined in the proof of the lemma 1 for an arbitrary side , the chain of the side .

Lemma 2: the chains of any two distinct non-opposite sides intersect (i.e. have a common parallelogram). Consider any two pairs and of opposite sides. Since the 14-gon is convex, if we bypass its perimeter (in some direction), the sides , , , go in that order. Connect the midpoints of the parallel to sides of the parallelograms from the chain of to obtain a polyline (the ends of the polyline are the midpoints of and ). This polyline divides the 14-gon into two parts, with the sides and lying in distinct parts. Therefore, if we consider a similar polyline, corresponding to the chain of , these two polylines will intersect. This means that the chains of the sides and have a common parallelogram. Lemma 2 is proved.

Take any pairwise nonparallel sides of the 14-gon and to each of them (say, for ) put in the correspondence the shortest possible integer vector . Call this vector to be directive for and denote its coordinates by and . The minimality of the length of implies . From Lemma 2 it follows that for any two non-opposite sides and there exists a parallelogram with the sides parallel to and . The area of is divisible by the area of the parallelogram with the sides and , since can be divided into such parallelograms.

Finally, we will prove that there exists a parallelogram with area divisible by . The area of the parallelogram equals . If both and are divisible by , then is divisible by . Suppose that not more than one directive vector has an -coordinate which is divisible by . Among at least directive vectors with nonzero -coordinates there exist vectors with . Therefore, the area of the corresponding parallelogram equals
Final answer
5

Techniques

VectorsVectorsPigeonhole principleGreatest common divisors (gcd)Inverses mod n