Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Let have incommensurable angles, with and , where are positive integers. Then has a tiling by the triangle with and . For every tiling by this shape, its count is square if and only if is square.
The criterion is independent of the chosen representation of . It does not assert that itself is an attainable tile count for every representation .
Source and scope. Beeson–Laczkovich–Zhang, arXiv:2604.03609v3, Proposition 29, pp. 15–16. Complete rewritten deduction from the external existence and counting results below. The extra minimum-count remarks on p. 16 are not used in this proof.
Proof
The angle sum gives , and . Since is rational, Laczkovich, Tilings of triangles (1995), Theorem 2.4, gives a tiling of by .
For any such -tiling, the required external counting theorem is Beeson, Triangle tiling: the case , arXiv:1206.2229v3, Theorem 4, p. 28. It supplies positive integers with
Since , there is a positive rational with . Thus
Multiplication by a nonzero rational square preserves being a rational square. Both and are positive integers, and an integer that is a rational square is an integer square. This proves the criterion.
Source qualifications
The necessity proof of Theorem 1 on p. 9 cites “Theorem 4 of [3]” for this equation. Reference [3] there is the isosceles-triangle paper. The proof of Proposition 29 correctly cites reference [1], and the equation is indeed Theorem 4 of arXiv:1206.2229v3, p. 28. We use that identified input.
The additional p. 16 remark claims the necessity of from that same theorem and hence an exact smallest count. The cited theorem's statement and proof do not establish that divisibility; Theorem 5 of the external paper assumes it for a construction. This extra necessity and the claimed exact minimum require separate justification and are not asserted here. Neither is needed for the square criterion.
Bears on. Problem 633.