Monsky's theorem states that a square cannot be dissected into an odd number of triangles of equal area
(Monsky 1970). Every positive even count is possible: divide the square
into
equal-width rectangles and bisect each rectangle
along a diagonal.
Monsky's proof uses a 2-adic valuation to color the plane and obtain a parity obstruction. The quantitative Monsky problem asks how close the areas can be for a fixed odd count. Stein's equidissection conjecture extends the obstruction to balanced polygons.