Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
A nondegenerate Euclidean triangle admits a tiling into a positive nonsquare number of congruent triangles if and only if its angles can be labeled so that at least one of the following holds:
- ; this includes the equilateral triangle.
- and its legs have ratio for positive integers with not a square.
- .
- and .
- and .
- and .
- and for positive integers with not a square.
- and .
The representation of a positive rational number as need not be reduced. Scaling numerator and denominator changes either quadratic expression by a rational square, so its square status is independent of the representation. A tiling covers by finitely many congruent closed triangles whose interiors are disjoint; a reptiling uses a tile similar to .
Thus the answer to Problem 633 is the complement of these eight families.
Source and scope. Beeson, Laczkovich, and Zhang, Solution of Erdős Problem 633, arXiv:2604.03609v3, Theorem 1, pp. 1–2; necessity pp. 8–9; sufficiency pp. 12–17. This is a complete rewritten proof at the source's dependency boundary. The linked pages supply every essential same-paper deduction; earlier classification, existence, and counting theorems and the four elliptic-curve group data are stated and cited as external inputs, not recursively reproved.
Necessity
Suppose an -tiling exists with nonsquare. If it is a reptiling, the external reptiling classification recorded in Theorem 11 gives family 2 or 3. If is isosceles, family 1 holds. We may therefore assume that is non-isosceles and the tiling is not a reptiling.
Theorem 11 gives one of six angle patterns, and Proposition 13 proves their precise rationality conditions. Its second, third, fourth, and sixth rows give families 4, 5, 6, and 8 directly. For the first row, and is rational. The half-angle doubling identity gives
Here , so and the denominator is nonzero. Consequently this row also gives family 4.
For the fifth row, and . The external tiling equation, stated precisely in Proposition 29, supplies positive integers with and . Since and is nonsquare, this is family 7. These cases exhaust the possibilities. The source's p. 9 cross-reference for this equation is corrected by the explicit identification on Proposition 29's page.
Sufficiency: the three elementary families
In family 1, cut along the symmetry axis to obtain two congruent triangles. In family 2, the external reptiling construction of Golomb and Snover–Waiveris–Williams, recorded with Theorem 6 in Theorem 11, gives congruent similar tiles. The hypothesis makes this count nonsquare; Figure 6 on p. 25 illustrates the construction with counts and .
Family 3 has a three-tile reptiling, as in Figure 7 on p. 25. To read that diagram explicitly, take the large right triangle with vertices , , and . Put and on and , respectively. The triangles , , and have side lengths . They partition the large –– triangle, giving three congruent tiles. These coordinates simply specify the source's diagram.
Sufficiency: excluding commensurable-angle exceptions
For families 4–8, suppose first that all angles of are rational multiples of . In families 4, 5, and 8, Lemma 24 applies to . Since is rational, its possible squared tangent values are and ; the value would give , and would give . Thus or .
For family 6, is rational. The cosine theorem stated with Lemma 24 forces , and rationality of leaves only . In family 7, applying the same argument to gives .
In families 5 and 6, would then make . In family 7, and force . In family 8, with forces . All are impossible for a triangle. In family 4, the only nondegenerate possibility is , already covered by family 1.
Sufficiency: the incommensurable families
It remains to treat incommensurable angles. For family 4, Proposition 10 applied to shows that is rational for either non- angle. Label them with ; equality would make equilateral. Then Proposition 26 gives a nonsquare tiling.
Family 5 is Proposition 28 and family 6 is Proposition 27. Family 7 follows from existence and the exact square criterion in Proposition 29. Family 8 is Proposition 30. These propositions use Laczkovich's existence theorems and show that every tiling with the specified tile shape has the requisite nonsquare count. This finishes both directions.
Bears on. Problem 633.