ISL 2015 G8
A triangulation of a convex polygon is a partitioning of into triangles by diagonals having no common points other than the vertices of the polygon. We say that a triangulation is a Thaiangulation if all triangles in it have the same area. Prove that any two different Thaiangulations of a convex polygon differ by exactly two triangles. (In other words, prove that it is possible to replace one pair of triangles in the first Thaiangulation with a different pair of triangles so as to obtain the second Thaiangulation.) (Bulgaria)
Dataset text NuminaMath olympiads. Quoted with source.
Official text: IMO 2015 Shortlist booklet, page 7.
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).