Square Trisection

A square trisection is a problem of assembling three identical squares from a larger square, using a minimal number of pieces. This paper presents an historical overview of the square trisection problem starting with its origins in the third century. We detail the reasoning behind some of the main known solutions. Finally, we give a new solution and three ruler-and-compass constructions. We conclude with a conjecture of optimality of the proposed solution.


Published in:
Bulletin d'Informatique Approfondie et Applications, 86
Year:
2010
Keywords:
Laboratories:




 Record created 2010-12-06, last modified 2018-03-17

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)