Show that for every integer n ≥ 6, there is a convex hexagon that can be decomposed into n congruent triangles.
Source: Asian Pacific Mathematical Olympiad
The solution will be posted shortly. Back to the Archives
