Heronian triangle

In geometry, a Heronian triangle (or Heron triangle) is a triangle whose side lengths a, b, and c and area T are all positive integers. Heronian triangles are named after Heron of Alexandria, based on their relation to Heron's formula which Heron demonstrated with the example triangle of sides 13, 14, 15 and area 84.

Heron's formula implies that the Heronian triangles are exactly the positive integer solutions of the Diophantine equation 16T2=(a+b+c)(a+b−c)(b+c−a)(c+a−b); that is, the side lengths and area of any Heronian triangle satisfy the equation, and any positive integer solution of the equation describes a Heronian triangle.

If the three side lengths are setwise coprime (meaning that the greatest common divisor of all three sides is 1), the Heronian triangle is called primitive.

Triangles whose side lengths and areas are all rational numbers (positive rational solutions of the above equation) are sometimes also called Heronian triangles or rational triangles; in this article, these more general triangles will be called rational Heronian triangles. Every (integral) Heronian triangle is a rational Heronian triangle. Conversely, every rational Heronian triangle is geometrically similar to exactly one primitive Heronian triangle.

In any rational Heronian triangle, the three altitudes, the circumradius, the inradius and exradii, and the sines and cosines of the three angles are also all rational numbers.

Scaling to primitive triangles

Scaling a triangle with a factor of s consists of multiplying its side lengths by s; this multiplies the area by s2 and produces a similar triangle. Scaling a rational Heronian triangle by a rational factor produces another rational Heronian triangle.

Given a rational Heronian triangle of side lengths pd,qd,rd, the scale factor dgcd⁡(p,q,r) produces a rational Heronian triangle such that its side lengths a,b,c are setwise coprime integers. It is proved below that the area T is an integer, and thus the triangle is a Heronian triangle. Such a triangle is often called a primitive Heronian triangle.

In summary, every similarity class of rational Heronian triangles contains exactly one primitive Heronian triangle. A byproduct of the proof is that exactly one of the side lengths of a primitive Heronian triangle is an even integer.

Proof: One has to prove that, if the side lengths a,b,c of a rational Heronian triangle are coprime integers, then the area T is also an integer and exactly one of the side lengths is even.

The Diophantine equation given in the introduction shows immediately that 16T2 is an integer. Its square root 4T is also an integer, since the square root of an integer is either an integer or an irrational number.

If exactly one of the side lengths is even, all the factors in the right-hand side of the equation are even, and, by dividing the equation by 16, one gets that T2 and T are integers.

As the side lengths are supposed to be coprime, one is left with the case where one or three side lengths are odd. Supposing that c is odd, the right-hand side of the Diophantine equation can be rewritten ((a+b)2−c2)(c2−(a−b)2), with a+b and a−b even. As the square of an odd integer is congruent to 1 modulo 4, the right-hand side of the equation must be congruent to −1 modulo 4. It is thus impossible, that one has a solution of the Diophantine equation, since 16T2 must be the square of an integer, and the square of an integer is congruent to 0 or 1 modulo 4.

Examples

Any Pythagorean triangle is a Heronian triangle. The side lengths of such a triangle are integers, by definition. In any such triangle, one of the two shorter sides has even length, so the area (the product of these two sides, divided by two) is also an integer.

A triangle with sidelengths a, b and c1 + c2, and height h.

Examples of Heronian triangles that are not right-angled are the isosceles triangle obtained by joining a Pythagorean triangle and its mirror image along a side of the right angle. Starting with the Pythagorean triple 3, 4, 5 this gives two Heronian triangles with side lengths (5, 5, 6) and (5, 5, 8) and area 12.

More generally, given two Pythagorean triples (a,h,c1) and (b,h,c2) with largest entries a and b, one can join the corresponding triangles along the sides of length h (see the figure) to get a Heronian triangle with side lengths a,b,c1+c2 and area 12h(c1+c2).

There are Heronian triangles that cannot be obtained by joining Pythagorean triangles. For example, the Heronian triangle of side lengths 5,29,30 and area 72, since none of its altitudes is an integer. Such Heronian triangles are known as indecomposable. However, every Heronian triangle can be constructed from right triangles with rational side lengths, and is thus similar to a decomposable Heronian triangle. In fact, at least one of the altitudes of a triangle is inside the triangle, and divides it into two right triangles. These triangles have rational sides, since the cosine and the sine of the angles of a Heronian triangle are rational numbers, and, with notation of the figure, one has h=asin⁡α and c1=acos⁡α, where α is the left-most angle of the triangle.

Rationality properties

Many quantities related to a Heronian triangle are rational numbers. In particular:

Properties of side lengths

Here are some properties of side lengths of Heronian triangles, whose side lengths are a, b, c and area is T.

Parametrizations

A parametric equation or parametrization of Heronian triangles consists of an expression of the side lengths and area of a triangle as functions—typically polynomial functions—of some parameters, such that the triangle is Heronian if and only if the parameters satisfy some constraints—typically, to be positive integers satisfying some inequalities. It is also generally required that all Heronian triangles can be obtained up to a scaling for some values of the parameters, and that these values are unique, if an order on the sides of the triangle is specified.

The first such parametrization was discovered by Brahmagupta (598-668 A.D.), who did not prove that all Heronian triangles can be generated by the parametrization. In the 18th century, Leonhard Euler provided another parametrization and proved that it generates all Heronian triangles. These parametrizations are described in the next two subsections.

In the third subsection, a rational parametrization—that is a parametrization where the parameters are positive rational numbers—is naturally derived from properties of Heronian triangles. Both Brahmagupta's and Euler's parametrizations can be recovered from this rational parametrization by clearing denominators. This provides a proof that Brahmagupta's and Euler's parametrizations generate all Heronian triangles.

Brahmagupta's parametric equation

The Indian mathematician Brahmagupta (598-668 A.D.) discovered the following parametric equations for generating Heronian triangles, but did not prove that every similarity class of Heronian triangles can be obtained this way.[citation needed]

For three positive integers m, n and k that are setwise coprime (gcd⁡(m,n,k)=1) and satisfy mn>k2 (to guarantee positive side lengths) and m≥n (for uniqueness):

a=n(m2+k2),s−a=12(b+c−a)=n(mn−k2),b=m(n2+k2),s−b=12(c+a−b)=m(mn−k2),c=(m+n)(mn−k2),s−c=12(a+b−c)=(m+n)k2,s=12(a+b+c)=mn(m+n),T=mnk(m+n)(mn−k2),r=k(mn−k2),

where s is the semiperimeter, T is the area, and r is the inradius.

The resulting Heronian triangle is not always primitive, and a scaling may be needed for getting the corresponding primitive triangle. For example, taking m = 36, n = 4 and k = 3 produces a triangle with a = 5220, b = 900 and c = 5400, which is similar to the (5, 29, 30) Heronian triangle with a proportionality factor of 180.

The fact that the generated triangle is not primitive is an obstacle for using this parametrization for generating all Heronian triangles with size lengths less than a given bound, since the size of gcd⁡(a,b,c) cannot be predicted.

Euler's parametric equation

The following method of generating all Heronian triangles was discovered by Leonhard Euler, who was the first to provably parametrize all such triangles.

For four positive integers m coprime to n and p coprime to q (gcd⁡(m,n)=gcd⁡(p,q)=1) satisfying mp>nq (to guarantee positive side lengths):

a=mn(p2+q2),s−a=mq(mp−nq),b=pq(m2+n2),s−b=np(mp−nq),c=(mq+np)(mp−nq),s−c=nq(mq+np),s=mp(mq+np),T=mnpq(mq+np)(mp−nq),r=nq(mp−nq),

where s is the semiperimeter, T is the area, and r is the inradius.

Even when m, n, p, and q are pairwise coprime, the resulting Heronian triangle may not be primitive. In particular, if m, n, p, and q are all odd, the three side lengths are even. It is also possible that a, b, and c have a common divisor other than 2. For example, with m = 2, n = 1, p = 7, and q = 4, one gets (a, b, c) = (130, 140, 150), where each side length is a multiple of 10; the corresponding primitive triple is (13, 14, 15), which can also be obtained by dividing the triple resulting from m = 2, n = 1, p = 3, q = 2 by two, then exchanging b and c.

Half-angle tangent parametrization

A triangle with side lengths and interior angles labeled as in the text

First we make an observation about half-angle tangents in any triangle. Let a,b,c>0 be the side lengths of any triangle, let α,β,γ be the interior angles opposite these sides, and let t=tan⁡α2, u=tan⁡β2, and v=tan⁡γ2 be the half-angle tangents. The values t,u,v are all positive and satisfy tu+uv+vt=1; this "triple tangent identity" is the half-angle tangent version of the fundamental triangle identity written as α2+β2+γ2=π2 radians (that is, 90°), as can be proved using the addition formula for tangents.

We can show that rational Heronian triangles have rational half-angle tangents. By area formulas such as ⁠T=12absin⁡γ⁠ and the law of cosines such as ⁠c2=a2+b2−2abcos⁡γ⁠, all of the sines and the cosines of α,β,γ are rational numbers if the triangle is a rational Heronian triangle. Because a half-angle tangent is a rational function of the sine and cosine, it follows that the half-angle tangents ⁠t⁠, ⁠u⁠, and ⁠v⁠ are also rational. They can be computed directly with (t,u,v)=(Ts(s−a),Ts(s−b),Ts(s−c)), where ⁠T⁠ is the area of the triangle and ⁠s=12(a+b+c)⁠ is its semiperimeter.

Conversely, we can show that rational half-angle tangents lead to rational Heronian triangles. That is, if t,u,v are positive rational numbers such that tu+uv+vt=1, it can be seen that they are the half-angle tangents of the interior angles of a class of similar Heronian triangles. The condition tu+uv+vt=1 can be rearranged to v=1−tut+u, and the restriction v>0 requires tu<1. Thus there is a bijection between the similarity classes of rational Heronian triangles and the pairs of positive rational numbers (t,u) whose product is less than 1.

To make this bijection explicit, one can choose, as a specific member of the similarity class, the triangle inscribed in a unit-diameter circle with side lengths equal to the sines of the opposite angles: a=sin⁡α=2t1+t2,s−a=2u(1−tu)(1+t2)(1+u2),b=sin⁡β=2u1+u2,s−b=2t(1−tu)(1+t2)(1+u2),c=sin⁡γ=2(t+u)(1−tu)(1+t2)(1+u2),s−c=2tu(t+u)(1+t2)(1+u2),s=2(t+u)(1+t2)(1+u2),T=4tu(t+u)(1−tu)(1+t2)2(1+u2)2,r=2tu(1−tu)(1+t2)(1+u2), where s=12(a+b+c) is the semiperimeter, T=12absin⁡γ is the area, r=(s−a)(s−b)(s−c)/s is the inradius, and all these values are rational because t and u are rational.

The rational Heronian triangles generated from rational half-angle tangents can be scaled to give integral Heronian triangles according to the methods of Euler and Brahmagupta. To obtain a Heronian triangle with integer side lengths, the denominators of a, b, and c must be cleared. There are several ways to do this. If t=m/n and u=p/q, with gcd⁡(m,n)=gcd⁡(p,q)=1 (irreducible fractions), and the triangle is scaled up by 12(m2+n2)(p2+q2), the result is Euler's parametrization. If, instead, 1/t and 1/u are reduced to the lowest common denominator, that is, if t=k/m and u=k/n with gcd⁡(m,n,k)=1, then one gets Brahmagupta's parametrization by scaling up the triangle by (k2+m2)(k2+n2)/2k. This proves that either parametrization generates all Heronian triangles.

Other results

Kurz (2008) has derived fast algorithms for generating Heronian triangles.

There are infinitely many primitive and indecomposable non-Pythagorean Heronian triangles with integer values for the inradius r and all three of the exradii (ra,rb,rc), including the ones generated by: Thm. 4 

a=5(5n2+n−1),ra=5n+3,b=(5n+3)(5n2−4n+1),rb=5n2+n−1,c=(5n−2)(5n2+6n+2),rc=(5n−2)(5n+3)(5n2+n−1),r=5n−2,T=(5n−2)(5n+3)(5n2+n−1)=rc.

There are infinitely many Heronian triangles that can be placed on a lattice such that not only are the vertices at lattice points, as holds for all Heronian triangles, but additionally the centers of the incircle and excircles are at lattice points.: Thm. 5 

See also Integer triangle § Heronian triangles for parametrizations of some types of Heronian triangles.

Examples

The list of primitive integer Heronian triangles, sorted by area and, if this is the same, by perimeter, starts as in the following table. "Primitive" means that the greatest common divisor of the three side lengths equals 1.

Area Perimeter side length a side length b side length c
6 12 5 4 3
12 16 6 5 5
12 18 8 5 5
24 32 15 13 4
30 30 13 12 5
36 36 17 10 9
36 54 26 25 3
42 42 20 15 7
60 36 13 13 10
60 40 17 15 8
60 50 24 13 13
60 60 29 25 6
66 44 20 13 11
72 64 30 29 5
84 42 15 14 13
84 48 21 17 10
84 56 25 24 7
84 72 35 29 8
90 54 25 17 12
90 108 53 51 4
114 76 37 20 19
120 50 17 17 16
120 64 30 17 17
120 80 39 25 16
126 54 21 20 13
126 84 41 28 15
126 108 52 51 5
132 66 30 25 11
156 78 37 26 15
156 104 51 40 13
168 64 25 25 14
168 84 39 35 10
168 98 48 25 25
180 80 37 30 13
180 90 41 40 9
198 132 65 55 12
204 68 26 25 17
210 70 29 21 20
210 70 28 25 17
210 84 39 28 17
210 84 37 35 12
210 140 68 65 7
210 300 149 148 3
216 162 80 73 9
234 108 52 41 15
240 90 40 37 13
252 84 35 34 15
252 98 45 40 13
252 144 70 65 9
264 96 44 37 15
264 132 65 34 33
270 108 52 29 27
288 162 80 65 17
300 150 74 51 25
300 250 123 122 5
306 108 51 37 20
330 100 44 39 17
330 110 52 33 25
330 132 61 60 11
330 220 109 100 11
336 98 41 40 17
336 112 53 35 24
336 128 61 52 15
336 392 195 193 4
360 90 36 29 25
360 100 41 41 18
360 162 80 41 41
390 156 75 68 13
396 176 87 55 34
396 198 97 90 11
396 242 120 109 13

The list of primitive Heronian triangles whose sides do not exceed 600,000 has been computed by Kurz (2008).

Heronian triangles with perfect square sides

As of February 2021, only two primitive Heronian triangles with perfect square sides are known:

(18532, 43802, 44272, Area=32918611718880), published in 2013.

(117892, 681042, 685952, Area=284239560530875680), published in 2018.

Heronian triangles with perfect square sides are connected to the Perfect cuboid problem. The existence of a solution to the Perfect cuboid problem is equivalent to the existence of a solution to the Perfect square triangle problem: "Does there exist a triangle whose side lengths are perfect squares and whose angle bisectors are integers?".

Equable triangles

A shape is called equable if its area equals its perimeter. There are exactly five equable Heronian triangles: the ones with side lengths (5,12,13), (6,8,10), (6,25,29), (7,15,20), and (9,10,17), though only four of them are primitive.

Almost-equilateral Heronian triangles

Since the area of an equilateral triangle with rational sides is an irrational number, no equilateral triangle is Heronian. However, a sequence of isosceles Heronian triangles that are "almost equilateral" can be developed from the duplication of right-angled triangles, in which the hypotenuse is almost twice as long as one of the legs. The first few examples of these almost-equilateral triangles are listed in the following table (sequence A102341 in the OEIS):

Side lengthArea
ab=ac
55612
171716120
6565661848
24124124025080
901901902351780
3361336133604890480
12545125451254668149872
468174681746816949077360

There is a unique sequence of Heronian triangles that are "almost equilateral" because the three sides are of the form n − 1, n, n + 1. A method for generating all solutions to this problem based on continued fractions was described in 1864 by Edward Sang, and in 1880 Reinhold Hoppe gave a closed-form expression for the solutions. The first few examples of these almost-equilateral triangles are listed in the following table (sequence A003500 in the OEIS):

Side lengthAreaInradius
n − 1nn + 1
12300
34561
131415844
515253117015
1931941951629656
723724725226974209
2701270227033161340780
100831008410085440317862911
37633376343763561328366410864

Subsequent values of n can be found by multiplying the previous value by 4, then subtracting the value prior to that one (52 = 4 × 14 − 4, 194 = 4 × 52 − 14, etc.), thus:

nt=4nt−1−nt−2,

where t denotes any row in the table. This is a Lucas sequence. Alternatively, the formula (2+3)t+(2−3)t generates all n for positive integers t. Equivalently, let T = area and y = inradius, then,

((n−1)2+n2+(n+1)2)2−2((n−1)4+n4+(n+1)4)=(6ny)2=(4T)2

where {n, y} are solutions to n2 − 12y2 = 4. A small transformation n = 2x yields a conventional Pell equation x2 − 3y2 = 1, the solutions of which can then be derived from the regular continued fraction expansion for √3.

The variable n is of the form n=2+2k, where k is 7, 97, 1351, 18817, .... The numbers in this sequence have the property that k consecutive integers have integral standard deviation.

See also