Brahmagupta triangle
{{Short description|Triangle whose side lengths are consecutive positive integers and area is a positive integer}}
A Brahmagupta triangle is a triangle whose side lengths are consecutive positive integers and area is a positive integer.{{cite journal |last1=R. A. Beauregard and E. R. Suryanarayan |title=The Brahmagupta Triangles |journal=The College Mathematics Journal |date=January 1998 |volume=29 |issue=1 |pages=13–17 |doi=10.1080/07468342.1998.11973907 |url=https://www.maa.org/sites/default/files/pdf/mathdl/CMJ/methodoflastresort.pdf |access-date=6 June 2024}}{{cite journal |last1=Herb Bailey and William Gosnell |title=Heronian Triangles with Sides in Arithmetic Progression: An Inradius Perspective |journal=Mathematics Magazine |date=October 2012 |volume=85 |issue=4 |pages=290–294 |doi=10.4169/math.mag.85.4.290}} The triangle whose side lengths are 3, 4, 5 is a Brahmagupta triangle and so also is the triangle whose side lengths are 13, 14, 15. The Brahmagupta triangle is a special case of the Heronian triangle which is a triangle whose side lengths and area are all positive integers but the side lengths need not necessarily be consecutive integers. A Brahmagupta triangle is called as such in honor of the Indian astronomer and mathematician Brahmagupta (c. 598 – c. 668 CE) who gave a list of the first eight such triangles without explaining the method by which he computed that list.{{cite book |last= Venkatachaliyengar |first= K. |date=1988 |editor-last= Subbarayappa |editor-first=B. V. |title=Scientific Heritage of India: Proceedings of a National Seminar, September 19-21, 1986, Bangalore |publisher= The Mythic Society, Bangalore |pages=36–48 |chapter=The Development of Mathematics in Ancient India: The Role of Brahmagupta |isbn=}}
A Brahmagupta triangle is also called a Fleenor-Heronian triangle in honor of Charles R. Fleenor who discussed the concept in a paper published in 1996.{{cite journal |last1=Charles R. Fleenor |title=Heronian Triangles with Consecutive Integer Sides |journal=Journal of Recreational Mathematics |date=1996 |volume=28 |issue=2 |pages=113–115}}{{cite web |last1=N. J. A. Sloane |title=A003500 |url=https://oeis.org/A003500 |website=Online Encyclopedia of Integer Sequences |publisher=The OEIS Foundation Inc. |access-date=6 June 2024}}{{cite web |title=Definition:Fleenor-Heronian Triangle |url=https://proofwiki.org/wiki/Definition:Fleenor-Heronian_Triangle |website=Proof-Wiki |access-date=6 June 2024}}{{cite journal |last1=Vo Dong To |title=Finding all Fleenor-Heronian triangles |journal=Journal of Recreational Mathematics |date=2003 |volume=32 |issue=4 |pages=298–301}} Some of the other names by which Brahmagupta triangles are known are super-Heronian triangle{{cite web |last1=William H. Richardson |title=Super-Heronian Triangles |url=https://www.math.wichita.edu/~richardson/heronian/heronian.html |website=www.wichita.edu |publisher=Wichita State University |access-date=7 June 2024}} and almost-equilateral Heronian triangle.{{cite journal |last1=Roger B Nelsen |title=Almost Equilateral Heronian Triangles |journal=Mathematics Magazine |date=2020 |volume=93 |issue=5 |pages=378–379|doi=10.1080/0025570X.2020.1817708 }}
The problem of finding all Brahmagupta triangles is an old problem. A closed form solution of the problem was found by Reinhold Hoppe in 1880.{{cite journal |last1=H. W. Gould |title=A triangle with integral sides and area |journal=Fibonacci Quarterly |date=1973 |volume=11 |pages=27–39 |doi=10.1080/00150517.1973.12430863 |url=https://www.fq.math.ca/Scanned/11-1/gould.pdf |access-date=7 June 2024}}
Generating Brahmagupta triangles
Let the side lengths of a Brahmagupta triangle be , and where is an integer greater than 1. Using Heron's formula, the area of the triangle can be shown to be
:
Since has to be an integer, must be even and so it can be taken as where is an integer. Thus,
:
Since has to be an integer, one must have for some integer . Hence, must satisfy the following Diophantine equation:
: .
This is an example of the so-called Pell's equation with . The methods for solving the Pell's equation can be applied to find values of the integers and .
Obviously , is a solution of the equation . Taking this as an initial solution the set of all solutions of the equation can be generated using the following recurrence relations
:
x_{n+1}=2x_n+3y_n, \quad y_{n+1}= x_n+2y_n \text{ for } n=1,2,\ldots
or by the following relations
:
\begin{align}
x_{n+1} & = 4x_{n}-x_{n-1}\text{ for }n=2,3,\ldots \text{ with } x_1=2, x_2=7\\
y_{n+1} & = 4y_{n}-y_{n-1}\text{ for }n=2,3,\ldots \text{ with } y_1=1, y_2=4.
\end{align}
They can also be generated using the following property:
:
x_n+\sqrt{3} y_n=(x_1+\sqrt{3}y_1)^n\text{ for } n=1,2, \ldots
The following are the first eight values of and and the corresponding Brahmagupta triangles:
::
class="wikitable" | ||||||||
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
---|---|---|---|---|---|---|---|---|
2 | 7 | 26 | 97 | 362 | 1351 | 5042 | 18817 | |
1 | 4 | 15 | 56 | 209 | 780 | 2911 | 10864 | |
Brahmagupta triangle | 3,4,5 | 13,14,15 | 51,52,53 | 193,194,195 | 723,724,725 | 2701,2702,2703 | 10083,10084,10085 | 37633,37634,37635 |
The sequence is entry {{OEIS link|A001075}} in the Online Encyclopedia of Integer Sequences (OEIS) and the sequence is entry {{OEIS link|A001353}} in OEIS.
Generalized Brahmagupta triangles
In a Brahmagupta triangle the side lengths form an integer arithmetic progression with a common difference 1. A generalized Brahmagupta triangle is a Heronian triangle in which the side lengths form an arithmetic progression of positive integers. Generalized Brahmagupta triangles can be easily constructed from Brahmagupta triangles. If are the side lengths of a Brahmagupta triangle then, for any positive integer , the integers are the side lengths of a generalized Brahmagupta triangle which form an arithmetic progression with common difference . There are generalized Brahmagupta triangles which are not generated this way. A primitive generalized Brahmagupta triangle is a generalized Brahmagupta triangle in which the side lengths have no common factor other than 1.{{cite journal |last1=James A. Macdougall |title=Heron Triangles With Sides in Arithmetic Progression |journal=Journal of Recreational Mathematics |date=January 2003 |volume=31 |pages=189–196}}
To find the side lengths of such triangles, let the side lengths be where are integers satisfying . Using Heron's formula, the area of the triangle can be shown to be
:.
For to be an integer, must be even and one may take for some integer. This makes
:.
Since, again, has to be an integer, has to be in the form for some integer . Thus, to find the side lengths of generalized Brahmagupta triangles, one has to find solutions to the following homogeneous quadratic Diophantine equation:
:.
It can be shown that all primitive solutions of this equation are given by
:
\begin{align}
d & = \vert m^2 - 3n^2\vert /g\\
x & = (m^2 + 3n^2)/g\\
y & = 2mn/g
\end{align}
where and are relatively prime positive integers and .
If we take we get the Brahmagupta triangle . If we take we get the Brahmagupta triangle . But if we take we get the generalized Brahmagupta triangle which cannot be reduced to a Brahmagupta triangle.