Dissecting the square into seven or nine congruent parts
classification
💻 cs.CG
keywords
congruentninesevensquarecomputer-basedconvexdissectingdivided
read the original abstract
We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.