IMO Shortlist 2007 problem C8


Kvaliteta:
  Avg: 0,0
Težina:
  Avg: 9,0
Dodao/la: arhiva
2. travnja 2012.
LaTeX PDF
Given is a convex polygon P with n vertices. Triangle whose vertices lie on vertices of P is called good if all its sides are equal in length. Prove that there are at most \frac {2n}{3} good triangles.

Author: unknown author, Ukraine
Izvor: Međunarodna matematička olimpijada, shortlist 2007