Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Let a non-isosceles triangle be tiled by congruent triangles with angles . After labeling the tile angles, either the tiling is a reptiling ( is similar to its tile), or it belongs to one of these groups:
- Group 1: , and the angles of are or .
- Group 2: , and the angles of are , , , or .
Source. Beeson, Laczkovich, and Zhang, arXiv:2604.03609v3, Theorem 11, p. 5. Printed and PDF page numbers agree throughout this source.
External inputs and proof scope
The following are imported results, not proofs reconstructed here. The source restates the first four as Lemma 4 and Theorems 5, 6, and 8 on pp. 2–3.
- If is not equilateral and is tiled by , then all angles of are rational multiples of if and only if all angles of are. This is the first paragraph of the proof of Theorem 5.3 in M. Laczkovich, Tilings of triangles, Discrete Mathematics 140 (1995), 79–94.
- If has rational multiples of as angles and is not isosceles, every tiling of is a reptiling. Laczkovich's Theorem 5.3 gives , where counts the similarity classes of possible tiles. Since itself is always a possible tile, gives precisely this conclusion. This is the full deduction used for Theorem 5 here.
- The classification of reptilings in S. L. Snover, C. Waiveris, and J. K. Williams, Rep-tiling for triangles, Discrete Mathematics 91 (1991), 193–200, DOI, says that a nonsquare tile count is possible only for a right triangle whose legs have ratio and , or for the –– triangle with . The corresponding reptilings exist. Every triangle also has the usual -tile reptilings.
- If a triangle is tiled by , where is neither similar to the large triangle nor right-angled and its angles are not all rational multiples of , then the side ratios of are rational. This is Theorem 1.2 of Beeson and Zhang, Rationality of certain triangle tilings, arXiv:2604.01314v1, p. 2. Their Theorem 1.1 supplies the -degree case. Their introduction identifies a flaw in the older 2012 argument, so the 2026 result is the input used here; the older assertion is not silently substituted for it.
- Laczkovich's 1995 Theorem 4.1 classifies tilings whose tile has incommensurable angles. Its non-isosceles, non-reptile cases are exactly the two groups displayed above. This classification is an external dependency; its proof is not reproduced here.
Proof
If the tiling is not a reptiling, input 2 implies that has incommensurable angles. Input 1 gives the same conclusion for the tile. Apply input 5 and remove the alternatives in which is isosceles. The surviving alternatives are the six listed angle patterns. This is the complete reduction made in the source's proof of Theorem 11.
In these six patterns the tile is not right-angled: in Group 1 its third angle is , and in Group 2 it is . Consequently input 4 applies. After scaling, tile sides are positive integers. Each side of is a sum of whole tile sides along the boundary, so it too has integer length in this normalization. This boundary observation justifies the rational scale factors in subsequent area ratios.
Bears on. Problem 633.