Skip to main content
OlympiadHQ

Browse · MathNet

Print

Estonian Mathematical Olympiad

Estonia geometry

Problem

There are 8 distinct points marked on a circle. Juku wants to draw as many triangles as possible in such a way that all vertices of each triangle he draws are at the marked points, and no two of these triangles share a side. Find the largest number of triangles that can be drawn under these conditions.

problem
Solution
Assume w.l.o.g. that the points marked on the circle are equally spaced and number the marked points counterclockwise with natural numbers , , , . Consider a triangle with vertices marked at points , , and its copies obtained by rotating the original triangle counterclockwise by , , , of a full turn around the center of the circle (illustrated in Fig. 29 with different colors). These triangles do not share any sides because all sides of the original triangle have different lengths, and each rotation of a side with a specific length results in different segments. Therefore, it is possible to draw triangles under the given conditions.

Fig. 29

On the other hand, note that from each marked point, at most segments can be drawn to the remaining marked points. Each triangle uses either or of these segments. Thus, each marked point can be the endpoint of at most different triangle sides in total. Since we count each side twice (once at each endpoint), there can be at most , or different triangle sides. Since each triangle has sides, there can be at most , or triangles.
Final answer
8

Techniques

RotationCounting two ways