Abstract
We prove that the number of non-similar triangles T which can be dissected into two, three or five similar non-right triangles is equal to zero, one and nine, respectively. We find all these triangles. Moreover, every triangle can be dissected into n similar triangles whenever n = 4 or n ≥ 6. In the last section we allow dissections into right-triangles but we add another restriction. We prove that in any perfect, prime and simplicial dissection into at least three tiles, the tiles must have one of only three possible shapes. © Springer 2005.
Cite
CITATION STYLE
Zak, A. (2005). Dissection of a triangle into similar triangles. Discrete and Computational Geometry, 34(2), 295–312. https://doi.org/10.1007/s00454-005-1167-1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.