Question 3
Let $(m,n)$ be positive integers with $n \ge 3$ and draw a regular $n$-gon.
We wish to triangulate this $n$-gon into $n-2$ triangles,
each colored one of $m$ colors, so that each color has an equal sum of areas.
For which $(m,n)$ is such a triangulation and coloring possible?
Proposed by Krit Boonsiriseth. One nonofficial editorial point; manual essay grading.
We wish to triangulate this $n$-gon into $n-2$ triangles,
each colored one of $m$ colors, so that each color has an equal sum of areas.
For which $(m,n)$ is such a triangulation and coloring possible?
Proposed by Krit Boonsiriseth. One nonofficial editorial point; manual essay grading.