TOPICS
Search

Monsky's Theorem


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 2k is possible: divide the square into k 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.


See also

Quantitative Monsky Problem, Square Dissection, Stein's Equidissection Conjecture

Explore with Wolfram|Alpha

References

Monsky, P. "On Dividing a Square into Triangles." Amer. Math. Monthly 77, 161-164, 1970. https://doi.org/10.2307/2317329.

Cite this as:

Weisstein, Eric W. "Monsky's Theorem." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/MonskysTheorem.html

Subject classifications