a. A convex heptagon is divided into triangles by drawing its diagonals. Prove that in such case you can obtain 5 or 7 triangles, but can not get 6 triangles.
b. Prove that there exists nonconvex heptagon that can be divided by internal diagonals into 6 triangles. Internal diagonal of a polygon M is a segment connecting the two non-neighbouring vertices of M and does not go beyond the figure.
Solution
a. If all vertices of resulting triangles coincide with vertices of the heptagon, the sum of the angles of the triangles equals the sum of the angles of the heptagon and equals 5⋅180∘. Hence, there are only 5 triangles. In case if two diagonals intersect not at the vertex of the heptagon, then this intersection point A lies inside the heptagon because of its convexity. Then the angles of triangles adjacent to point A sum up to 360∘, and the sum of the angles of resulting triangles is not less than 5⋅180∘+360∘=7⋅180∘. Thus, in this case will have at least 7 triangles.
b. The heptagon and corresponding division are shown in fig. 38. Note that the horizontal diagonal lies through the vertex of the heptagon.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.