A triangle dissection into congruent triangles divides a triangle into pieces of the same size and shape.
Dividing each side of a triangle into equal intervals and drawing parallels to the sides gives
congruent pieces, each similar
to the original triangle.
Beeson et al. (2026) classify the outer triangles that admit a dissection into a nonsquare number of congruent triangles, the question posed in problem 633 in the Erdős problems collection. Outside the isosceles triangles, the eligible similarity classes form a countable set. Their Figure 16 exhibits a dissection into 7128 congruent triangles whose side lengths are proportional to 3, 5, and 7.
Problem 634 asks which positive integers
occur as the number of congruent pieces in a triangle
dissection. If the pieces must also be similar to the
original triangle (a rep-tile dissection when
), the possible counts are
,
,
and
for positive integers
and
(OEIS A005792) (Snover
et al. 1991). For general congruent dissections, Bonfioli (2026) reports a
Lean 4 verification that exactly 105 values of
occur for
.
The characterization for arbitrary
remains open.
The three medians of an equilateral triangle divide it into six congruent 30-60-90 triangles. This gives a congruent dissection with a piece count outside A005792.