Super-Heronian Triangles

William H. Richardson

About 20 or so years ago a collague posed a problem to me. He defined a Super-Heronian triangle to be a triangle with sides three consecutive integers and whose area is also an integer. An immediate example of a Super-Heronian triangle is the 3, 4, 5 right triangle with area 6. The question he posed to me was ``How many Super-Heronian triangle are there?'' I was reminded of this problem recently and solved it again. I showed the result to one of my students who requested that I put it on my webpage so that he could have a friend in another state see the result. So, here it is. A note about the appearance of this document. The original document was written in LaTex and I converted it to an HTML file. All the equations are made into graphics and, for some reason, the background color for the graphics turned out to be gray--I have no control over that. So in order to make the document more readible, I change the background of the page to the same color of gray.

On with the story. My initial guess was that there would be an infinite number of these triangles and it seemed to me that the obvious way to attack this problem was to use Heron's formula for the area of a triangle. $A = \sqrt{s(s-a)s-b)(s-c)}$ where $a, b, c$ are the lengths of the three sides of the triangle and $s=\frac{1}{2}(a+b+c)$. I let the sides of the triangle be represented by the three consecutive integers $n-1, \ n, \ n+1$. I then found, after simplification, that

$$A = \frac{n}{4}\sqrt{3(n^2-4)}.$$ (1)

Upon examination of this result it was clear that $n$ had to be an even integer in order for $A$ to be an integer. For if $n$ were odd, $n^2-4$ would be odd and even if $3(n^2-4)$ were a perfect square, $4$ would not divide $n\sqrt{3(n^2-4)}$. Also, by observation, it is clear that $n^2-4$ must be equal to a number of the form $3m^2$. I did a quick search and found that the integers $n=2, 4, 14$ all worked. Since my assumption was that there were going to be an infinite number of these triangles, I looked for a recurrence relation for which $2, 4, 14$ were the first three terms that generated and infinite sequence of values for $n$ satisfying (1). I would then test this sequence of to see if the values always determined a Super-Heronian triangle.

Looking at the three terms, $2, 4, 14$, my guess was that these values satisfied the sequence given by the recurrence relation

$$b_{n+2}=4b_{n+1}-b_n, \mbox{ with } b_0=2, \ b_1 = 4.$$ (2)

I used this sequence to generate more terms, all of which seemed to work (see the table on the next page).

The sequence generated by the recurrence relation (2) can also be represented by

$$b_n = (2+\sqrt{3})^n + (2-\sqrt{3})^n, \ \ n = 0, 1, 2, 3, \ldots$$ (3)

This sequence can be obtained from the auxiliary equation $t^2-4t+2=0$ which has the roots $2\pm \sqrt{3}$. Therefore we let

$$b_n = A(2+\sqrt{3})^n+B(2-\sqrt{3})^n \mbox{ with } b_0=2 \mbox{ and } b_1 =4.$$

Here are the first terms terms which do, in fact, generate Super-Heronian triangles. The first row generates a line which represents a degenerate triangle.

a	b	c	Area
1	2	3	0
3	4	5	6
13	14	15	84
51	52	53	1170
193	194	195	16296
723	724	725	226974
2701	2702	2703	3161340
10083	10084	10085	44031786
37633	37634	37635	613283664
140451	140452	140453	8541939510
524173	524174	524175	118973869476

Table 1

As one can see, the sides get large very fast. It is left to show that every term of the sequence $\{ b_n \}$ yields a solution; that is, an area that is an integer. Let

$$b_n = (2+\sqrt{3})^n + (2-\sqrt{3})^n, \ \ n = 0, 1, 2, 3, \ldots.$$

Then

$$\begin{eqnarray*} A_n &=& \frac{(2+\sqrt{3})^n+(2-\sqrt{3})^n}{4}\sqrt{3\left[\... ...rac{\sqrt{3}}{4}\left[(2+\sqrt{3})^{2n}-(2-\sqrt{3})^{2n}\right] \end{eqnarray*}$$

Now, by using mathematical induction, this last expression can be shown to be an integer for all integers $n\ge 0$. (Left as an exercise for the reader.) Hence, since the sequence is infinite, there are an infinite number of Super-Heronian triangles. It should be noted that we have not shown that our sequence $\{ b_n \}$ generates all Super-Heronian triangles, but it does verify that there are an infinite number of them.

Let us examine another interesting feature of these triangles. Suppose we use the area formula $A = \frac{1}{2} bh$. We then have the area of the triangle given by

$$A = \frac{1}{2} n h_b$$

where $n$ is the length of side $b$ and $h_b$ is the altitude to side $b$. Thus,

$$h_b = \frac{2A}{n} = \frac{\sqrt{3(n^2-4)}}{2}$$

which is an integer. Moreover, $h_b$ divides the triangle into two right triangles with side $b$ divided into two lengths, $b_1=\frac{n}{2}-2$ and $b_2=\frac{n}{2}+2$. It is interesting to note that one of these right triangles has sides that are a primitive Pythagorean triple. In the table below, the asterisks mark the primitive triple in each row. Note how the primitve triples alternate.

$a$	$b$	$c$	$h_b$	$b_1$	$b_2$
1	2	3	0	-	-
3	4	5*	3*	0	4*
13*	14	15	12*	5*	9
51	52	53*	45*	24	28*
193*	194	195	168*	95*	99
723	724	725*	627*	360	364*
2701*	2702	2703	2340*	1349*	1353
10083	10084	10085*	8733*	5040	5044*
37633*	37634	37635	32592*	18815*	18819
140451	140452	140453*	121635*	70224	70228*
524173*	524174	524175	453948*	262085*	262089

Table 2

One might observe that the $h_b$s can be generated on their own from the recurrence relation

$$h_{b_{n+2}} = 4h_{b_{n+1}}-h_{b_n}, \ \mbox{ where } h_{b_0}=0, h_{b_1} = 3.$$

One can investigate these triangles and find many interesting properties. I will leave further investigation to the reader.

About this document ...

This document was generated using the LaTeX2HTML translator Version 2002-2-1 (1.70)

Copyright © 1993, 1994, 1995, 1996, Nikos Drakos, Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999, Ross Moore, Mathematics Department, Macquarie University, Sydney.

The command line arguments were:
latex2html -white heronian.tex

The translation was initiated by Bill Richardson on 2007-04-12