Automedian triangle

The side lengths of an automedian triangle satisfy the formula ${\displaystyle 2a^{2}=b^{2}+c^{2}}$ or a permutation thereof, analogous to the Pythagorean theorem characterizing right triangles as the triangles satisfying the formula ${\displaystyle a^{2}+b^{2}=c^{2}}$. Equivalently, in order for the three numbers ${\displaystyle a}$, ${\displaystyle b}$, and ${\displaystyle c}$ to be the sides of an automedian triangle, the sequence of three squared side lengths ${\displaystyle b^{2}}$, ${\displaystyle a^{2}}$, and ${\displaystyle c^{2}}$ should form an arithmetic progression.[1]

If ${\displaystyle x}$, ${\displaystyle y}$, and ${\displaystyle z}$ are the three sides of a right triangle, sorted in increasing order by size, and if ${\displaystyle 2x<z}$, then ${\displaystyle z}$, ${\displaystyle x+y}$, and ${\displaystyle y-x}$ are the three sides of an automedian triangle. For instance, the right triangle with side lengths 5, 12, and 13 can be used to form in this way an automedian triangle with side lengths 13, 17, and 7.[2]

The condition that ${\displaystyle 2x<z}$ is necessary: if it were not met, then the three numbers ${\displaystyle a=z}$, ${\displaystyle b=x+y}$, and ${\displaystyle c=y-x}$ would still satisfy the equation ${\displaystyle 2a^{2}=b^{2}+c^{2}}$ characterizing automedian triangles, but they would not satisfy the triangle inequality and could not be used to form the sides of a triangle.

Consequently, using Euler's formula that generates primitive Pythagorean triangles it is possible to generate primitive integer automedian triangles (i.e., with the sides sharing no common factor) as

$${\displaystyle {\begin{aligned}a&=m^{2}+n^{2}\\b&=m^{2}+2mn-n^{2}\\c&=|m^{2}-2mn-n^{2}|\\\end{aligned}}}$$

with ${\displaystyle m}$ and ${\displaystyle n}$ coprime, ${\displaystyle m+n}$ odd, and to satisfy the triangle inequality ${\displaystyle n<m<n{\sqrt {3}}}$ (if the quantity inside the absolute value signs is negative) or ${\displaystyle m>(2+{\sqrt {3}})n}$ (if that quantity is positive). Then this triangle's medians ${\displaystyle t_{a},t_{b},t_{c}}$ are found by using the above expressions for its sides in the general formula for medians:

$${\displaystyle t_{a}={\sqrt {\frac {2b^{2}+2c^{2}-a^{2}}{4}}}={\frac {a{\sqrt {3}}}{2}},\qquad t_{b}={\sqrt {\frac {2a^{2}+2c^{2}-b^{2}}{4}}}={\frac {c{\sqrt {3}}}{2}},\qquad t_{c}={\sqrt {\frac {2a^{2}+2b^{2}-c^{2}}{4}}}={\frac {b{\sqrt {3}}}{2}},}$$

where the second equation in each case reflects the automedian feature ${\displaystyle 2a^{2}=b^{2}+c^{2}.}$

From this can be seen the similarity relationships

$${\displaystyle {\frac {t_{a}}{t_{b}}}={\frac {a}{c}},\qquad {\frac {t_{b}}{t_{c}}}={\frac {c}{b}},\qquad {\frac {t_{c}}{t_{a}}}={\frac {b}{a}}\qquad {\text{and hence}}\qquad t_{a}:t_{b}:t_{c}\quad =\quad a:c:b.}$$

There is a primitive integer-sided automedian triangle that is not generated from a right triangle: namely, the equilateral triangle with sides of unit length.

There are 18 primitive integer automedian triangles, shown here as triples of sides ${\displaystyle (a,b,c)}$, with ${\displaystyle b\leq 200}$:

For example, (26, 34, 14) is not a primitive automedian triple, as it is a multiple of (13, 17, 7) and does not appear above.

If ${\displaystyle \Delta (a,b,c)}$ is the area of the automedian triangle, by Heron's formula ${\displaystyle \Delta (t_{a},t_{b},t_{c})=(3/4)\Delta (a,b,c).}$[3]

The Euler line of an automedian triangle is perpendicular to the median to side ${\displaystyle a}$.[2]

If the medians of an automedian triangle are extended to the circumcircle of the triangle, then the three points ${\displaystyle LMN}$ where the extended medians meet the circumcircle form an isosceles triangle. The triangles for which this second triangle ${\displaystyle LMN}$ is isosceles are exactly the triangles that are themselves either isosceles or automedian. This property of automedian triangles stands in contrast to the Steiner–Lehmus theorem, according to which the only triangles two of whose angle bisectors have equal length are the isosceles triangles.[2]

Additionally, suppose that ${\displaystyle ABC}$ is an automedian triangle, in which vertex ${\displaystyle A}$ stands opposite the side ${\displaystyle a}$. Let ${\displaystyle G}$ be the point where the three medians of ${\displaystyle ABC}$ intersect, and let ${\displaystyle AL}$ be one of the extended medians of ${\displaystyle ABC}$, with ${\displaystyle L}$ lying on the circumcircle of ${\displaystyle ABC}$. Then ${\displaystyle BGCL}$ is a parallelogram, the two triangles ${\displaystyle BGL}$ and ${\displaystyle CLG}$ into which it may be subdivided are both similar to ${\displaystyle ABC}$, ${\displaystyle G}$ is the midpoint of ${\displaystyle AL}$, and the Euler line of the triangle is the perpendicular bisector of ${\displaystyle AL}$.[2]

When generating a primitive automedian triangle from a primitive Pythagorean triple using the Euclidean parameters ${\displaystyle m,n}$, then ${\displaystyle m>n}$ and it follows that ${\displaystyle b\geq a\geq c}$. As non-primitive automedian triangles are multiples of their primitives the inequalities of the sides apply to all integer automedian triangles. Equality occurs only for trivial equilateral triangles. Furthermore, because ${\displaystyle m+n}$ is always odd, all the sides ${\displaystyle a,b,c}$ have to be odd. This fact allows automedian triples to have sides and perimeter of prime numbers only. For example, (13, 17, 7) has perimeter 37.

Because in a primitive automedian triangle side ${\displaystyle a}$ is the sum of two squares and equal to the hypotenuse of the generating primitive Pythagorean triple, it is divisible only by primes congruent to 1 (mod 4). Consequently, ${\displaystyle a}$ must be congruent to 1 (mod 4).

Similarly, because the sides are related by ${\displaystyle 2a^{2}=b^{2}+c^{2}}$, each of the sides ${\displaystyle b}$ and ${\displaystyle c}$ in the primitive automedian is the difference between twice a square and a square. They are also the sum and difference of the legs of a primitive Pythagorean triple. This constrains ${\displaystyle b}$ and ${\displaystyle c}$ to be divisible only by primes congruent to ±1 (mod 8). Consequently, ${\displaystyle b}$ and ${\displaystyle c}$ must be congruent to ±1 (mod 8).[4]

The study of integer squares in arithmetic progression has a long history stretching back to Diophantus and Fibonacci; it is closely connected with congrua, which are the numbers that can be the differences of the squares in such a progression.[1] However, the connection between this problem and automedian triangles is much more recent. The problem of characterizing automedian triangles was posed in the late 19th century in the Educational Times (in French) by Joseph Jean Baptiste Neuberg, and solved there with the formula ${\displaystyle 2a^{2}=b^{2}+c^{2}}$ by William John Greenstreet.[5]

Apart from the trivial cases of equilateral triangles, the triangle with side lengths 17, 13, and 7 is the smallest (by area or perimeter) automedian triangle with integer side lengths.[2]

There is only one automedian right triangle, the triangle with side lengths proportional to 1, the square root of 2, and the square root of 3.[2] This triangle is the second triangle in the spiral of Theodorus. It is the only right triangle in which two of the medians are perpendicular to each other.[2]

• median triangle
• Integer triangle
• Kepler triangle, a right triangle in which the squared edge lengths form a geometric progression instead of an arithmetic progression

• Automedian Triangles and Magic Squares K. S. Brown's mathpages