MathDB
Problems
Contests
National and Regional Contests
Moldova Contests
Moldova National Olympiad
2009 Moldova National Olympiad
9.4
9.4
Part of
2009 Moldova National Olympiad
Problems
(1)
cut a triangle into at least 2 triangles with each side=1, when it has side >1
Source: 2009 Moldova NMO 9.4
3/27/2021
A side of an arbitrary triangle has a length greater than
1
1
1
. Prove that the given triangle it can be cut into at least
2
2
2
triangles, so that each of them has a side of length equal to
1
1
1
.
geometry
combinatorial geometry