Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
If and , then has a tiling by , and every such tiling is nonsquare.
Source and scope. Beeson–Laczkovich–Zhang, arXiv:2604.03609v3, Proposition 31, pp. 17–18. Complete rewritten proof with the external existence input identified below. This result is needed for Theorem 3.
Proof
Put , , and . Then and . Proposition 10 gives . Laczkovich, Tilings of triangles (1995), Theorem 2.5, states that under these hypotheses the displayed can be tiled by .
Normalize the tile and boundary sides to integers. Comparing the area formulas relative to the sides opposite and gives
for a positive rational . Put , with . Since , Proposition 10 transforms the count into
If were square, then would be a rational square. Write with coprime positive integers . Clearing the denominator would make
an integer square. Modulo , this is . If , it is , impossible for a square. Thus , and , where
Then must also be a square; modulo it equals . The same argument forces , contradicting coprimality. Hence cannot be square.
Bears on. Problem 633.