TOPICS
Search

Triangle Dissection


A triangle dissection divides a triangle into finitely many smaller triangles with nonoverlapping interiors.

Hoggatt and Denman (1961) showed that any obtuse triangle can be divided into eight acute isosceles triangles.

There are 1, 4, 23, 180, 1806, 20198, ... (OEIS A056814) topologically distinct ways to divide a triangle into n=2, 3, ... smaller triangles (Vicher).

A triangle partition is prime if it does not contain a triangle partition of lower order. The numbers of prime triangle partitions of orders n=2, 3, ... are 1, 1, 3, 8, 62, 535, 4213, ... (OEIS A053740).

TriangleDissection

A specific type of triangle dissection consists of a triangle DeltaABC together with an interior point P such that the original side lengths and the additional three line segments created by connecting the triangulation point with the vertices are all integers. An example of such a dissection is illustrated above (Pegg).

TriangleDissections3

Other possible dissections allow cut lines to be drawn from arbitrary points along the sides. Allowing only primitive triangles without any parallel lines, isosceles triangles, or similar triangles, the smallest three-piece integer dissection of each of the four possible types is illustrated above.

TriangleDissections4

Similarly, the smallest four-piece integer dissection for each of the 23 possible types is shown above.

TriangleDissections5

Two 5-piece dissections are illustrated above (Pegg).

For a fixed triangle T, let a_T(n) denote the number of dissections of T into n triangles, each similar to T. Two dissections are identified when they determine the same collection of triangular regions, so the order of the tiles and the order of their vertices are ignored. Tiles may be directly similar or inversely similar, and their scale factors need not be equal. This differs from a rep-tile dissection, in which the smaller copies are required to be congruent.

A triangle is called generic here when no additional relation among its angles or sides makes otherwise distinct arrangements coincide or produces exceptional arrangements. The computed counts for several generic and special classes are summarized below (E. Pegg, Jr., pers. comm., Sep. 28, 2026).

classOEIScounts beginning at n=1
generic non-right triangleA3997651, 0, 0, 4, 0, 36, 64, 468, 1792, 9262
generic isosceles triangleA4005101, 0, 0, 2, 0, 11, 19, 108, 385, 1747
generic right triangleA3997701, 1, 2, 10, 60, 363, 2346, 16581
Kepler triangle1, 1, 2, 10, 60, 363, 2345
isosceles right triangleA4005111, 1, 1, 5, 20, 100, 543, 3209, 19986
30-60-90 triangleA4004621, 1, 3, 18, 121, 844, 6397, 53145

The first value counts the uncut triangle. A 3-4-5 right triangle realizes the generic right-triangle counts. A computational enumeration based on dissection topologies by B. Trease, together with an independent coordinate search, verified the displayed generic right values (Pegg 2026). The 4-5-6 triangle, 45-60-75 triangle, and heptagonal triangle have the generic non-right counts through ten pieces (E. Pegg, Jr., pers. comm., Sep. 28, 2026).

Among the 36 catalogued six-piece dissections of a generic non-right triangle into triangles similar to itself, 12 have their interior vertex at either the symmedian point (3 arrangements) or a vertex of the first Brocard triangle (9 arrangements) (E. Pegg, Jr., pers. comm., Oct. 1, 2026).

Three further six-piece arrangements have their interior vertices at the vertices of the third Brocard triangle. In each arrangement, the four points where cuts meet the sides lie on a circle. The centers of these three circles lie on the Brocard axis (E. Pegg, Jr., pers. comm., Oct. 1, 2026).

Special relations among sides can nevertheless change a count. For the Kepler triangle, two layouts that are distinct for a generic right triangle coalesce into a single configuration at the Kepler proportions, giving a seven-piece count of 2345 rather than 2346 (E. Pegg, Jr., pers. comm., Sep. 28, 2026).

KeplerTriangleDissection7

The exceptional seven-piece dissection of the Kepler triangle is illustrated above. Five pieces meet at the interior point.

RightTriangleDissections5

The 60 five-piece dissections are illustrated above with coloring by B. Trease (Pegg 2026). The altitude from the vertex of the right angle to the hypotenuse gives the unique two-piece dissection, and subdividing either resulting triangle in the same way produces the two three-piece layouts in the enumeration. More generally, Zak (2005) proved that every triangle can be dissected into n triangles similar to it for n=4 or n>=6.

If the pieces need only be mutually similar, their shape can differ from that of the original triangle. Zak (2005) proved that exactly nine shapes of triangle, up to similarity, admit a dissection into five mutually similar non-right triangles. Among non-right triangles, only the isosceles triangle with angles 30, 30, and 120 degrees admits five pieces similar to the original.

TriangleDissection456

A 4-5-6 triangle admits two five-piece dissections into mutually similar triangles with side lengths in the ratio 1:sqrt(2):2 (Pegg 2019). These pieces are not similar to the original, so the constructions do not contribute to a_T(5).

RightTriangleDissections9

The three exact nine-piece constructions illustrated above have a single interior vertex at the first Brocard point, second Brocard point, or symmedian point. For the outer vertices (0,0), (4,0), and (0,3), the corresponding barycentric coordinates are 400:225:144, 225:144:400, and 25:9:16. Exact area and intersection calculations verify that each construction covers the 3-4-5 right triangle by nine nonoverlapping triangles similar to it (Pegg 2026).

For a 30-60-90 triangle, Pegg et al. (to appear) found that the numbers of arrangements with n=1, 2, ... pieces are 1, 1, 3, 18, 121, 844, 6397, 53145, ... (OEIS A400462). The 18 four-piece arrangements use 11 distinct multisets of piece areas. The 121 five-piece arrangements use 47 distinct such multisets, while the 844 six-piece arrangements use 235.

An arrangement is independent if it cannot be obtained from another catalogued arrangement by subdivision or by a local rotation or reflection. Among the five-piece arrangements, 84 arise by subdivision and 31 more have such a local partner, leaving 6 independent arrangements. The corresponding six-piece counts are 667, 154, and 23. There are 104 independent seven-piece arrangements. The 53145 eight-piece arrangements use 8793 distinct multisets of piece areas and include 731 independent arrangements. Altogether, the catalog through eight pieces contains 60530 arrangements (E. Pegg, Jr., pers. comm., Sep. 27, 2026). A complete search cannot be restricted to edge-to-edge triangulations: some valid layouts contain T-junctions, while others have an interior fan at which several right angle vertices meet without any triangle side continuing through the junction (Pegg et al. , to appear).

Laczkovich (1995) proved that every dissection of an equilateral triangle into similar triangles has a tile angle equal to 60 or 120 degrees. There exists an infinite family realizing the 120-degree case (Pegg 2026). Let n be a positive integer, and let q_n>1 be the unique positive real root of

 q_n^(2n+2)-q_n^(2n)-q_n^n-1=0.
(1)

The polynomial has value -2 at q_n=1 and tends to +infty as q_n->+infty, so such a root exists. Uniqueness follows from Descartes' rule of signs. The law of cosines shows that a triangle with sides proportional to 1, q_n^n, and q_n^(n+1) has an included angle of 120 degrees. Copies of this triangle with scale factors 1, q_n, ..., q_n^(2n), with the scale factors q_n^n and q_n^(2n) each occurring twice, form a dissection of an equilateral triangle into 2n+3 similar triangles. Two outer sides have length proportional to q_n^(3n+1), while the third has length proportional to sum_(j=0)^(n)q_n^(2j+1). Their equality follows from

 (q_n^2-1)(q_n^(3n+1)-sum_(j=0)^nq_n^(2j+1))=q_n(q_n^n-1)(q_n^(2n+2)-q_n^(2n)-q_n^n-1)=0.
(2)
SelfSimilarTriangleDissections

The six cases n=1, ..., 6 are shown above in reading order. For even n=2k, put x_k=q_(2k)^2. Then x_k is the unique positive real root of

 P_k(x)=x^(2k+1)-x^(2k)-x^k-1=0.
(3)

The first three roots are the tribonacci constant, theta_9, and theta_3, respectively, since

P_1(x)=x^3-x^2-x-1
(4)
P_2(x)=x^5-x^4-x^2-1
(5)
P_3(x)=(x^2+1)(x^5-x^4-x^3+x^2-1).
(6)

The roots x_k are strictly decreasing. Since x_k^k(x_k-1)=1+x_k^(-k),

 P_(k+1)(x_k)-P_k(x_k)=(x_k-1)x_k^k[x_k^k(x_k^2-1)-1]>0.
(7)

Since P_(k+1)(1)=-2 and P_(k+1) has only one positive real root by Descartes' rule of signs, it follows that x_(k+1)<x_k. Now x_4=1.367594... lies strictly between the two smallest Pisot numbers theta_1 and theta_2, while x_5=1.316627...<theta_1. It follows that x_k is a Pisot number precisely for k=1, 2, or 3. Also, q_1=theta_4 follows from q_1^4-q_1^2-q_1-1=(q_1+1)(q_1^3-q_1^2-1). The construction uses only the positive real root of the displayed polynomial, so the Pisot property is not required.


See also

Brocard Axis, Brocard Points, Equilateral Triangle, First Brocard Triangle, Integer Triangle, Pisot Number, Rep-Tile, Right Triangle, Similar Triangles, Square Dissection, Symmedian Point, Third Brocard Triangle, Triangle Dissection Paradox

Explore with Wolfram|Alpha

References

Hoggatt, V. E. Jr. and Denman, R. "Acute Isosceles Dissection of an Obtuse Triangle." Amer. Math. Monthly 68, 912-913, 1961.Laczkovich, M. "Tilings of Triangles." Disc. Math. 140, 79-94, 1995. https://doi.org/10.1016/0012-365X(93)E0176-5.Pegg, E.; Trease, B.; Hudson, A.; and McNeil, D. S. "How Does One Cut a 30-60-90 Triangle?" To appear in Geombinatorics.Pegg, E. Jr. "Five Similar Triangles from 4-5-6." Mathematics Stack Exchange. Jan. 23, 2019. https://math.stackexchange.com/questions/3084540/five-similar-triangles-from-4-5-6.Pegg, E. Jr. "MathPuzzle: Triangles." Apr. 24, 2012. https://www.mathpuzzle.com/triangle.html.Pegg, E. Jr. MathPuzzle. Jun. 1, 2002. https://www.mathpuzzle.com/itg3.gif.Pegg, E. Jr. "MathPuzzle: Dividing an Integer Triangle Into Smaller Integer Triangles." Jun. 1, 2002. https://www.mathpuzzle.com/itgrand.html. Pegg, E. Jr. Mathematical Games. Episode 45: "Filling Space with Similar Parts." Sep. 24, 2026. https://www.youtube.com/watch?v=hQW_dYMdMsw. Companion notebook: https://community.wolfram.com/t/28170.Sloane, N. J. A. Sequences A053740, A056814, A399765, A399770, A400462, A400510, and A400511 in "The On-Line Encyclopedia of Integer Sequences."Vichera, M. "Triangle Partitions." https://web.archive.org/web/20251209222405/http://www.vicher.cz/puzzle/triangles/triangles.htm.Zak, A. "Dissection of a Triangle into Similar Triangles." Disc. Comput. Geom. 34, 295-312, 2005. https://doi.org/10.1007/s00454-005-1167-1.

Referenced on Wolfram|Alpha

Triangle Dissection

Cite this as:

Weisstein, Eric W. "Triangle Dissection." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TriangleDissection.html

Subject classifications