On a tiling problem of R.B. Eggleton

Abstract A tiling of the plane with polygonal tiles is said to be strict if any point common to two tiles is a vertex of both or a vertex of neither. A triangle is said to be rational if its sides have rational length. Recently R.B. Eggleton asked if it is possible to strictly tile the plane with rational triangles using precisely one triangle from each congruence class. In this paper we constructively prove the existence of such a tiling by a suitable modification of the technique suggested by Eggleton. The theory of rational points on elliptic curves, in particular, the Nagell-Lutz theorem, plays a crucial role in completing the proof.