In geometry, a square trisection is a type of dissection problem which consists of cutting a square into pieces that can be rearranged to form three identical squares.
The dissection of a square in three congruent partitions is a geometrical problem that dates back to the Islamic Golden Age. Craftsman who mastered the art of zellige needed innovative techniques to achieve their fabulous mosaics with complex geometric figures. The first solution to this problem was proposed in the 10th century AD by the Persian mathematician Abu'l-Wafa' (940-998) in his treatise "On the geometric constructions necessary for the artisan".[1] Abu'l-Wafa' also used his dissection to demonstrate the Pythagorean theorem.[2] This geometrical proof of Pythagoras' theorem would be rediscovered in the years 1835 - 1840 [3] by Henry Perigal and published in 1875.[4]
The beauty of a dissection depends on several parameters. However, it is usual to search for solutions with the minimum number of parts. Far from being minimal, the square trisection proposed by Abu'l-Wafa' uses 9 pieces. In the 14th century Abu Bakr al-Khalil gave two solutions, one of which uses 8 pieces.[5] In the late 17th century Jacques Ozanam came back to this issue [6] and in the 19th century, solutions using 8 and 7 pieces were found, including one given by the mathematician Édouard Lucas.[7] In 1891 Henry Perigal published the first known solution with only 6 pieces [8] (see illustration below). Nowadays, new dissections are still found [9] (see illustration above) and the conjecture that 6 is the minimal number of necessary pieces remains unproved.