Heronian triangle

Last updated

In geometry, a Heronian triangle (or Heron triangle) is a triangle whose side lengths a, b, and c and area A are all positive integers. [1] [2] 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. [3]

Contents

Heron's formula implies that the Heronian triangles are exactly the positive integer solutions of the Diophantine equation

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. [4]

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; [5] 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 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 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 the scale factor produce a rational Heronian triangle such that its side lengths are setwise coprime integers. It is proved below that the area A 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 of a rational Heronian triangle are coprime integers, then the area A is also an integer and exactly one of the side lengths is even.

The Diophantine equation given in the introduction shows immediately that is an integer. Its square root 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 and 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

with and even. As the square of an odd integer is congruent to modulo 4, the right-hand side of the equation must be congruent to modulo 4. It is thus impossible, that one has a solution of the Diophantine equation, since 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 c, e and b + d, and height a. Triangle-heronian.svg
A triangle with sidelengths c, e and b + d, and height a.

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 and with largest entries c and e, one can join the corresponding triangles along the sides of length a (see the figure) for getting a Heronian triangle with side lengths and area (this is an integer, since the area of a Pythagorean triangle is an integer).

There are Heronian triangles that cannot be obtained by joining Pythagorean triangles. For example, the Heronian triangle of side lengths and area 72, since none of its altitudes is an integer. Such Heronian triangles are known as indecomposable. [6] 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 and 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 A.

Parametrizations

A parametric equation or parametrization of Heronian triangles consists of an expression of the side lengths and area of a triangle as functionstypically polynomial functions  of some parameters, such that the triangle is Heronian if and only if the parameters satisfy some constraintstypically, 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, Leonard 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 parametrizationthat 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, [20] 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 () and satisfy (to guarantee positive side lengths) and (for uniqueness):

where s is the semiperimeter, A 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 cannot be predicted. [20]

Euler's parametric equation

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

For four positive integers m coprime to n and p coprime to q() satisfying (to guarantee positive side lengths):

where s is the semiperimeter, A 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 Triangle-tikz.svg
A triangle with side lengths and interior angles labeled as in the text

Let be the side lengths of a triangle, let be the interior angles opposite these sides, and let and be the half-angle tangents. The values are all positive and satisfy ; this "triple tangent identity" is the half-angle tangent version of the fundamental triangle identity written as radians (that is, 90°), as can be proved using the addition formula for tangents. By the laws of sines and cosines, all of the sines and the cosines of are rational numbers if the triangle is a rational Heronian triangle and, because a half-angle tangent is a rational function of the sine and cosine, it follows that the half-angle tangents are also rational.

Conversely, if are positive rational numbers such that it can be seen that they are the half-angle tangents of the interior angles of a class of similar Heronian triangles. [22] The condition can be rearranged to and the restriction requires Thus there is a bijection between the similarity classes of rational Heronian triangles and the pairs of positive rational numbers 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: [23]

where is the semiperimeter, is the area, is the inradius, and all these values are rational because and are rational.

To obtain an (integral) Heronian triangle, the denominators of a, b, and c must be cleared. There are several ways to do this. If and with (irreducible fractions), and the triangle is scaled up by the result is Euler's parametrization. If and with (lowest common denomimator), and the triangle is scaled up by the result is similar but not quite identical to Brahmagupta's parametrization. If, instead, this is and that are reduced to the lowest common denominator, that is, if and with then one gets exactly Brahmagupta's parametrization by scaling up the triangle by

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 and all three of the exradii , including the ones generated by [24] :Thm. 4

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. [24] :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.

AreaPerimeterside length b+dside length eside length c
612543
1216655
1218855
243215134
303013125
363617109
365426253
424220157
6036131310
604017158
6050241313
606029256
6644201311
726430295
8442151413
8448211710
845625247
847235298
9054251712
9010853514
11476372019
12050171716
12064301717
12080392516
12654212013
12684412815
12610852515
13266302511
15678372615
156104514013
16864252514
16884393510
16898482525
18080373013
1809041409
198132655512
20468262517
21070292120
21070282517
21084392817
21084373512
21014068657
2103001491483
21616280739
234108524115
24090403713
25284353415
25298454013
25214470659
26496443715
264132653433
270108522927
288162806517
300150745125
3002501231225
306108513720
330100443917
330110523325
330132616011
33022010910011
33698414017
336112533524
336128615215
3363921951934
36090362925
360100414118
360162804141
390156756813
396176875534
396198979011
39624212010913

Lists of primitive Heronian triangles whose sides do not exceed 6,000,000 can be found at "Lists of primitive Heronian triangles". Sascha Kurz, University of Bayreuth, Germany. Archived (PDF) from the original on 2016-05-08. Retrieved 29 March 2016.

Heronian triangles with perfect square sides

Heronian triangles with perfect square sides are related to the Perfect cuboid problem. As of February 2021, only two primitive Heronian triangles with perfect square sides are known:

(1853², 4380², 4427², Area=32918611718880), published in 2013. [25]

(11789², 68104² , 68595², Area=284239560530875680), published in 2018. [26]

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), [27] [28] 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, [29] and in 1880 Reinhold Hoppe gave a closed-form expression for the solutions. [30] 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
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:

where t denotes any row in the table. This is a Lucas sequence. Alternatively, the formula generates all n for positive integers t. Equivalently, let A = area and y = inradius, then,

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. [31]

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

See also

Related Research Articles

<span class="mw-page-title-main">Euclidean algorithm</span> Algorithm for computing greatest common divisors

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements . It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

<span class="mw-page-title-main">Pythagorean triple</span> Integer side lengths of a right triangle

A Pythagorean triple consists of three positive integers a, b, and c, such that a2 + b2 = c2. Such a triple is commonly written (a, b, c), and a well-known example is (3, 4, 5). If (a, b, c) is a Pythagorean triple, then so is (ka, kb, kc) for any positive integer k. A triangle whose sides form a Pythagorean triple is called a Pythagorean triangle and is a right triangle.

<span class="mw-page-title-main">Trigonometric functions</span> Functions of an angle

In mathematics, the trigonometric functions are real functions which relate an angle of a right-angled triangle to ratios of two side lengths. They are widely used in all sciences that are related to geometry, such as navigation, solid mechanics, celestial mechanics, geodesy, and many others. They are among the simplest periodic functions, and as such are also widely used for studying periodic phenomena through Fourier analysis.

<span class="mw-page-title-main">Right triangle</span> Triangle containing a 90-degree angle

A right triangle or right-angled triangle, sometimes called an orthogonal triangle or rectangular triangle, is a triangle in which two sides are perpendicular, forming a right angle.

In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity, which are integers x and y such that

In mathematics, a quadric or quadric surface (quadric hypersurface in higher dimensions), is a generalization of conic sections (ellipses, parabolas, and hyperbolas). It is a hypersurface (of dimension D) in a (D + 1)-dimensional space, and it is defined as the zero set of an irreducible polynomial of degree two in D + 1 variables; for example, D = 1 in the case of conic sections. When the defining polynomial is not absolutely irreducible, the zero set is generally not considered a quadric, although it is often called a degenerate quadric or a reducible quadric.

<span class="mw-page-title-main">Root of unity</span> Number that has an integer power equal to 1

In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power n. Roots of unity are used in many branches of mathematics, and are especially important in number theory, the theory of group characters, and the discrete Fourier transform.

<span class="mw-page-title-main">Equilateral triangle</span> Shape with three equal sides

In geometry, an equilateral triangle is a triangle in which all three sides have the same length. In the familiar Euclidean geometry, an equilateral triangle is also equiangular; that is, all three internal angles are also congruent to each other and are each 60°. It is also a regular polygon, so it is also referred to as a regular triangle.

<span class="mw-page-title-main">Cyclic quadrilateral</span> Quadrilateral whose vertices can all fall on a single circle

In Euclidean geometry, a cyclic quadrilateral or inscribed quadrilateral is a quadrilateral whose vertices all lie on a single circle. This circle is called the circumcircle or circumscribed circle, and the vertices are said to be concyclic. The center of the circle and its radius are called the circumcenter and the circumradius respectively. Other names for these quadrilaterals are concyclic quadrilateral and chordal quadrilateral, the latter since the sides of the quadrilateral are chords of the circumcircle. Usually the quadrilateral is assumed to be convex, but there are also crossed cyclic quadrilaterals. The formulas and properties given below are valid in the convex case.

<span class="mw-page-title-main">Square root of 2</span> Unique positive real number which when multiplied by itself gives 2

The square root of 2 is a positive real number that, when multiplied by itself or squared, equals the number 2. It may be written in mathematics as or . It is an algebraic number, and therefore not a transcendental number. Technically, it should be called the principal square root of 2, to distinguish it from the negative number with the same property.

In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction used to show that a statement cannot possibly hold for any number, by showing that if the statement were to hold for a number, then the same would be true for a smaller number, leading to an infinite descent and ultimately a contradiction. It is a method which relies on the well-ordering principle, and is often used to show that a given equation, such as a Diophantine equation, has no solutions.

<span class="mw-page-title-main">Concyclic points</span> Points on a common circle

In geometry, a set of points are said to be concyclic if they lie on a common circle. A polygon whose vertices are concyclic is called a cyclic polygon, and the circle is called its circumscribing circle or circumcircle. All concyclic points are equidistant from the center of the circle.

<span class="mw-page-title-main">Parametric equation</span> Representation of a curve by a function of a parameter

In mathematics, a parametric equation defines a group of quantities as functions of one or more independent variables called parameters. Parametric equations are commonly used to express the coordinates of the points that make up a geometric object such as a curve or surface, called a parametric curve and parametric surface, respectively. In such cases, the equations are collectively called a parametric representation, or parametric system, or parameterization of the object.

In mathematics, an Euler brick, named after Leonhard Euler, is a rectangular cuboid whose edges and face diagonals all have integer lengths. A primitive Euler brick is an Euler brick whose edge lengths are relatively prime. A perfect Euler brick is one whose space diagonal is also an integer, but such a brick has not yet been found.

<span class="mw-page-title-main">Special right triangle</span> Right triangle with a feature making calculations on the triangle easier

A special right triangle is a right triangle with some regular feature that makes calculations on the triangle easier, or for which simple formulas exist. For example, a right triangle may have angles that form simple relationships, such as 45°–45°–90°. This is called an "angle-based" right triangle. A "side-based" right triangle is one in which the lengths of the sides form ratios of whole numbers, such as 3 : 4 : 5, or of other special numbers such as the golden ratio. Knowing the relationships of the angles or ratios of sides of these special right triangles allows one to quickly calculate various lengths in geometric problems without resorting to more advanced methods.

<span class="mw-page-title-main">Pythagorean quadruple</span> Four integers where the sum of the squares of three equals the square of the fourth

A Pythagorean quadruple is a tuple of integers a, b, c, and d, such that a2 + b2 + c2 = d2. They are solutions of a Diophantine equation and often only positive integer values are considered. However, to provide a more complete geometric interpretation, the integer values can be allowed to be negative and zero (thus allowing Pythagorean triples to be included) with the only condition being that d > 0. In this setting, a Pythagorean quadruple (a, b, c, d) defines a cuboid with integer side lengths |a|, |b|, and |c|, whose space diagonal has integer length d; with this interpretation, Pythagorean quadruples are thus also called Pythagorean boxes. In this article we will assume, unless otherwise stated, that the values of a Pythagorean quadruple are all positive integers.

In algebra, the greatest common divisor of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials. This concept is analogous to the greatest common divisor of two integers.

Besides Euclid's formula, many other formulas for generating Pythagorean triples have been developed.

<span class="mw-page-title-main">Integer triangle</span> Triangle with integer side lengths

An integer triangle or integral triangle is a triangle all of whose side lengths are integers. A rational triangle is one whose side lengths are rational numbers; any rational triangle can be rescaled by the lowest common denominator of the sides to obtain a similar integer triangle, so there is a close relationship between integer triangles and rational triangles.

<span class="mw-page-title-main">Group of rational points on the unit circle</span> Complex numbers with unit norm and both real and imaginary parts rational numbers

In mathematics, the rational points on the unit circle are those points (xy) such that both x and y are rational numbers ("fractions") and satisfy x2 + y2 = 1. The set of such points turns out to be closely related to primitive Pythagorean triples. Consider a primitive right triangle, that is, with integer side lengths a, b, c, with c the hypotenuse, such that the sides have no common factor larger than 1. Then on the unit circle there exists the rational point (a/cb/c), which, in the complex plane, is just a/c + ib/c, where i is the imaginary unit. Conversely, if (xy) is a rational point on the unit circle in the 1st quadrant of the coordinate system (i.e. x > 0, y > 0), then there exists a primitive right triangle with sides xcycc, with c being the least common multiple of the denominators of x and y. There is a correspondence between points (a, b) in the x-y plane and points a + ib in the complex plane which is used below.

References

  1. 1 2 3 Carlson, John R. (1970), "Determination of Heronian Triangles" (PDF), Fibonacci Quarterly , 8: 499–506
  2. Beauregard, Raymond A.; Suryanarayan, E. R. (January 1998), "The Brahmagupta Triangles" (PDF), College Mathematics Journal, 29 (1): 13–17, doi:10.2307/2687630, JSTOR   2687630
  3. Sastry, K. R. S. (2001). "Heron triangles: A Gergonne-Cevian-and-median perspective" (PDF). Forum Geometricorum . 1 (2001): 17–24.
  4. The sides and area of any triangle satisfy the Diophantine equation obtained by squaring both sides of Heron's formula; see Heron's formula § Proofs. Conversely, consider a solution of the equation where are all positive integers. It corresponds to a valid triangle if and only if the triangle inequality is satisfied, that is, if the three integers and are all positive. This is necessarily true in this case: if any of these sums were negative or zero, the other two would be positive and the right-hand side of the equation would thus be negative or zero and could not possibly equal the left-hand side which is positive.
  5. Weisstein, Eric W. "Heronian Triangle". MathWorld .
  6. 1 2 Yiu, Paul (2008), Heron triangles which cannot be decomposed into two integer right triangles (PDF), 41st Meeting of Florida Section of Mathematical Association of America
  7. 1 2 Somos, M. (December 2014). "Rational triangles" . Retrieved 2018-11-04.
  8. Mitchell, Douglas W. (2013), "Perpendicular Bisectors of Triangle Sides", Forum Geometricorum 13, 53−59: Theorem 2.
  9. Zelator, K., "Triangle Angles and Sides in Progression and the diophantine equation x2+3y2=z2", Cornell Univ. archive, 2008
  10. Bailey, Herbert, and DeTemple, Duane, "Squares inscribed in angles and triangles", Mathematics Magazine 71(4), 1998, 278–284.
  11. Clark Kimberling, "Trilinear distance inequalities for the symmedian point, the centroid, and other triangle centers", Forum Geometricorum , 10 (2010), 135−139. http://forumgeom.fau.edu/FG2010volume10/FG201015index.html
  12. Clark Kimberling's Encyclopedia of Triangle Centers "Encyclopedia of Triangle Centers" . Retrieved 2012-06-17.
  13. Yiu, Paul (2001). "Heronian triangles are lattice triangles". The American Mathematical Monthly . 108 (3): 261–263. doi:10.1080/00029890.2001.11919751.
  14. Buchholz, Ralph H.; MacDougall, James A. "Cyclic Polygons with Rational Sides and Area". Journal of Number Theory . 128 (1): 17–48. doi: 10.1016/j.jnt.2007.05.005 .
  15. 1 2 Fricke, Jan (2002-12-21). "On Heron Simplices and Integer Embedding". arXiv: math/0112239 .
  16. Proof. One can suppose that the Heronian triangle is primitive. The right-hand side of the Diophantine equation can be rewritten as If an odd length is chosen for c, all squares are odd, and therefore of the form and the two differences are multiple of 8. So is multiple of 64, and A is even. For the divisibility by three, one chooses c as non-multiple of 3 (the triangle is supposed to be primitive). If one of and is not a multiple of 3, the corresponding factor is a nultiple of 3 (since the square of a non-multiple of 3 has the form ), and this implies that 3 is a divisor of Otherwise, 3 would divide both and and the right-hand side of the Diophantine would not be the square of as being congruent to minus times a square modulo 3. So this last case is impossible.
  17. Proof. Supposing the triangle inequality implies If this implies that and the condition that there is exactly one even side length cannot be fulfilled. If one has two even side lengths if So, and the Diophantine equation becomes which is impossible for two positive integers.
  18. Buchholz, Ralph H.; MacDougall, James A. (1999). "Heron Quadrilaterals with sides in Arithmetic or Geometric progression". Bulletin of the Australian Mathematical Society. 59 (2): 263–269. doi: 10.1017/s0004972700032883 . hdl: 1959.13/803798 .
  19. Blichfeldt, H. F. (1896–1897). "On Triangles with Rational Sides and Having Rational Areas". Annals of Mathematics. 11 (1/6): 57–60. doi:10.2307/1967214. JSTOR   1967214.
  20. 1 2 Kurz, Sascha (2008). "On the generation of Heronian triangles". Serdica Journal of Computing. 2 (2): 181–196. arXiv: 1401.6150 . Bibcode:2014arXiv1401.6150K. doi:10.55630/sjc.2008.2.181-196. MR   2473583. S2CID   16060132..
  21. Dickson 1920, p. 193.
  22. Cheney, William Fitch Jr. (1929). "Heronian Triangles" (PDF). American Mathematical Monthly. 36 (1): 22–28. doi:10.1080/00029890.1929.11986902.
  23. Kocik, Jerzy; Solecki, Andrzej (2009). "Disentangling a triangle" (PDF). American Mathematical Monthly. 116 (3): 228–237. doi:10.1080/00029890.2009.11920932. S2CID   28155804.
  24. 1 2 Zhou, Li, "Primitive Heronian Triangles With Integer Inradius and Exradii", Forum Geometricorum 18, 2018, 71-77. http://forumgeom.fau.edu/FG2018volume18/FG201811.pdf
  25. Stănică, Pantelimon; Sarkar, Santanu; Sen Gupta, Sourav; Maitra, Subhamoy; Kar, Nirupam (2013). "Counting Heron triangles with constraints". Integers. 13: Paper No. A3, 17pp. hdl:10945/38838. MR   3083465.
  26. "LISTSERV - NMBRTHRY Archives - LISTSERV.NODAK.EDU".
  27. Dickson 1920, p. 199.
  28. Markowitz, L. (1981), "Area = Perimeter", The Mathematics Teacher, 74 (3): 222–3, doi:10.5951/MT.74.3.0222
  29. Sang, Edward (1864), "On the theory of commensurables", Transactions of the Royal Society of Edinburgh, 23 (3): 721–760, doi:10.1017/s0080456800020019, S2CID   123752318 . See in particular p. 734.
  30. Gould, H. W. (February 1973), "A triangle with integral sides and area" (PDF), Fibonacci Quarterly , 11 (1): 27–39.
  31. Richardson, William H. (2007), Super-Heronian Triangles
  32. Online Encyclopedia of Integer Sequences, OEIS:  A011943 .

Further reading