Pythagorean quadruple

Last updated June 23, 2024

A Pythagorean quadruple is a tuple of integers $a$ , $b$ , $c$ , and $d$ , such that $a 2 + b 2 + c 2 = d 2$ . They are solutions of a Diophantine equation and often only positive integer values are considered.^[1] 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.^[2] In this article we will assume, unless otherwise stated, that the values of a Pythagorean quadruple are all positive integers.

Parametrization of primitive quadruples

A Pythagorean quadruple is called primitive if the greatest common divisor of its entries is 1. Every Pythagorean quadruple is an integer multiple of a primitive quadruple. The set of primitive Pythagorean quadruples for which $a$ is odd can be generated by the formulas ${\begin{aligned}a&=m^{2}+n^{2}-p^{2}-q^{2},\\b&=2(mq+np),\\c&=2(nq-mp),\\d&=m^{2}+n^{2}+p^{2}+q^{2},\end{aligned}}$ where $m$ , $n$ , $p$ , $q$ are non-negative integers with greatest common divisor 1 such that $m + n + p + q$ is odd.^[3]^[4]^[1] Thus, all primitive Pythagorean quadruples are characterized by the identity $(m^{2}+n^{2}+p^{2}+q^{2})^{2}=(2mq+2np)^{2}+(2nq-2mp)^{2}+(m^{2}+n^{2}-p^{2}-q^{2})^{2}.$

Alternate parametrization

All Pythagorean quadruples (including non-primitives, and with repetition, though $a$ , $b$ , and $c$ do not appear in all possible orders) can be generated from two positive integers $a$ and $b$ as follows:

If $a$ and $b$ have different parity, let $p$ be any factor of $a 2 + b 2$ such that $p 2 < a 2 + b 2$ . Then $c = .mw-parser-output .sfrac{white-space:nowrap}.mw-parser-output .sfrac.tion,.mw-parser-output .sfrac .tion{display:inline-block;vertical-align:-0.5em;font-size:85%;text-align:center}.mw-parser-output .sfrac .num{display:block;line-height:1em;margin:0.0em 0.1em;border-bottom:1px solid}.mw-parser-output .sfrac .den{display:block;line-height:1em;margin:0.1em 0.1em}.mw-parser-output .sr-only{border:0;clip:rect(0,0,0,0);clip-path:polygon(0px 0px,0px 0px,0px 0px);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}a2 + b2 − p2/2p$ and $d = a 2 + b 2 + p 2 / 2 p$ . Note that $p = d - c$ .

A similar method exists^[5] for generating all Pythagorean quadruples for which $a$ and $b$ are both even. Let $l = a / 2$ and $m = b / 2$ and let $n$ be a factor of $l 2 + m 2$ such that $n 2 < l 2 + m 2$ . Then $c = l 2 + m 2 - n 2 / n$ and $d = l 2 + m 2 + n 2 / n$ . This method generates all Pythagorean quadruples exactly once each when $l$ and $m$ run through all pairs of natural numbers and $n$ runs through all permissible values for each pair.

No such method exists if both $a$ and $b$ are odd, in which case no solutions exist as can be seen by the parametrization in the previous section.

Properties

The largest number that always divides the product $abcd$ is 12.^[6] The quadruple with the minimal product is (1, 2, 2, 3).

Given a Pythagorean quadruple $(a,b,c,d)$ where $d^{2}=a^{2}+b^{2}+c^{2}$ then $d$ can be defined as the norm of the quadruple in that $d={\sqrt {a^{2}+b^{2}+c^{2}}}$ and is analogous to the hypotenuse of a Pythagorean triple.

Every odd positive number other than 1 and 5 can be the norm of a primitive Pythagorean quadruple $d^{2}=a^{2}+b^{2}+c^{2}$ such that $a,b,c$ are greater than zero and are coprime.^[7] All primitive Pythagorean quadruples with the odd numbers as norms up to 29 except 1 and 5 are given in the table below.

Similar to a Pythagorean triple which generates a distinct right triangle, a Pythagorean quadruple will generate a distinct Heronian triangle.^[8] If a, b, c, d is a Pythagorean quadruple with ${\textstyle a^{2}+b^{2}+c^{2}=d^{2}}$ it will generate a Heronian triangle with sides x, y, z as follows:-

x=d^{2}-a^{2}

y=d^{2}-b^{2}

z=d^{2}-c^{2}

.

It will have a semiperimeter ${\textstyle s=d^{2}}$ , an area ${\textstyle A=abcd}$ and an inradius ${\textstyle r=abc/d}$ .

The exradii will be:-

{\textstyle r_{x}=bcd/a}

{\textstyle r_{y}=acd/b}

{\textstyle r_{z}=abd/c}

.

The circumradius will be

{\textstyle R=(d^{2}-a^{2})(d^{2}-b^{2})(d^{2}-c^{2})/(4abcd)=abcd(1/a^{2}+1/b^{2}+1/c^{2}-1/d^{2})/4}

.

The ordered sequence of areas of this class of Heronian triangles can be found at (sequence A367737 in the OEIS ).

Relationship with quaternions and rational orthogonal matrices

A primitive Pythagorean quadruple $(a, b, c, d)$ parametrized by $(m, n, p, q)$ corresponds to the first column of the matrix representation $E (α)$ of conjugation $α (\cdot) α$ by the Hurwitz quaternion $α = m + ni + pj + qk$ restricted to the subspace of quaternions spanned by $i$ , $j$ , $k$ , which is given by $E(\alpha )={\begin{pmatrix}m^{2}+n^{2}-p^{2}-q^{2}&2np-2mq&2mp+2nq\\2mq+2np&m^{2}-n^{2}+p^{2}-q^{2}&2pq-2mn\\2nq-2mp&2mn+2pq&m^{2}-n^{2}-p^{2}+q^{2}\\\end{pmatrix}},$ where the columns are pairwise orthogonal and each has norm $d$ . Furthermore, we have that $1 / d E (α)$ belongs to the orthogonal group $SO(3,\mathbb {Q} )$ , and, in fact, all 3 × 3 orthogonal matrices with rational coefficients arise in this manner.^[9]

Primitive Pythagorean quadruples with small norm

There are 31 primitive Pythagorean quadruples in which all entries are less than 30.

(	1	,	2	,	2	,	3	)	(	2	,	10	,	11	,	15	)	(	4	,	13	,	16	,	21	)	(	2	,	10	,	25	,	27	)
(	2	,	3	,	6	,	7	)	(	1	,	12	,	12	,	17	)	(	8	,	11	,	16	,	21	)	(	2	,	14	,	23	,	27	)
(	1	,	4	,	8	,	9	)	(	8	,	9	,	12	,	17	)	(	3	,	6	,	22	,	23	)	(	7	,	14	,	22	,	27	)
(	4	,	4	,	7	,	9	)	(	1	,	6	,	18	,	19	)	(	3	,	14	,	18	,	23	)	(	10	,	10	,	23	,	27	)
(	2	,	6	,	9	,	11	)	(	6	,	6	,	17	,	19	)	(	6	,	13	,	18	,	23	)	(	3	,	16	,	24	,	29	)
(	6	,	6	,	7	,	11	)	(	6	,	10	,	15	,	19	)	(	9	,	12	,	20	,	25	)	(	11	,	12	,	24	,	29	)
(	3	,	4	,	12	,	13	)	(	4	,	5	,	20	,	21	)	(	12	,	15	,	16	,	25	)	(	12	,	16	,	21	,	29	)
(	2	,	5	,	14	,	15	)	(	4	,	8	,	19	,	21	)	(	2	,	7	,	26	,	27	)

Related Research Articles

<span class="mw-page-title-main">Diophantine equation</span> Polynomial equation whose integer solutions are sought

In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, for which only integer solutions are of interest. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponential Diophantine equation is one in which unknowns can appear in exponents.

A Pythagorean triple consists of three positive integers $a$ , $b$ , and $c$ , such that $a 2 + b 2 = c 2$ . Such a triple is commonly written $(a, b, c)$ , 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 side lengths are a Pythagorean triple is a right triangle and called a Pythagorean triangle.

<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 algebraic number theory, an algebraic integer is a complex number that is integral over the integers. That is, an algebraic integer is a complex root of some monic polynomial whose coefficients are integers. The set of all algebraic integers $A$ is closed under addition, subtraction and multiplication and therefore is a commutative subring of the complex numbers.

In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria.

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.

A Heronian tetrahedron is a tetrahedron whose edge lengths, face areas and volume are all integers. The faces must therefore all be Heronian triangles . Every Heronian tetrahedron can be arranged in Euclidean space so that its vertex coordinates are also integers.

In geometry, a Heronian triangle is a triangle whose side lengths $a$ , $b$ , and $c$ and area $A$ 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$ .

In mathematics, a Hurwitz quaternion is a quaternion whose components are either all integers or all half-integers. The set of all Hurwitz quaternions is

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.

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.

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

<span class="mw-page-title-main">Pythagorean theorem</span> Relation between sides of a right triangle

In mathematics, the Pythagorean theorem or Pythagoras' theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle. It states that the area of the square whose side is the hypotenuse is equal to the sum of the areas of the squares on the other two sides.

<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.

In mathematics, the rational points on the unit circle are those points (x, y) such that both x and y are rational numbers ("fractions") and satisfy x² + y² = 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/c, b/c), which, in the complex plane, is just a/c + ib/c, where i is the imaginary unit. Conversely, if (x, y) 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 xc, yc, c, 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.

Fermat's right triangle theorem is a non-existence proof in number theory, published in 1670 among the works of Pierre de Fermat, soon after his death. It is the only complete proof given by Fermat. It has many equivalent formulations, one of which was stated in 1225 by Fibonacci. In its geometric forms, it states:

In mathematics, a tree of primitive Pythagorean triples is a data tree in which each node branches to three subsequent nodes with the infinite set of all nodes giving all primitive Pythagorean triples without duplication.

The Lander, Parkin, and Selfridge conjecture concerns the integer solutions of equations which contain sums of like powers. The equations are generalisations of those considered in Fermat's Last Theorem. The conjecture is that if the sum of some k-th powers equals the sum of some other k-th powers, then the total number of terms in both sums combined must be at least k.

Cobham's theorem is a theorem in combinatorics on words that has important connections with number theory, notably transcendental numbers, and automata theory. Informally, the theorem gives the condition for the members of a set S of natural numbers written in bases b₁ and base b₂ to be recognised by finite automata. Specifically, consider bases b₁ and b₂ such that they are not powers of the same integer. Cobham's theorem states that S written in bases b₁ and b₂ is recognised by finite automata if and only if S differs by a finite set from a finite union of arithmetic progressions. The theorem was proved by Alan Cobham in 1969 and has since given rise to many extensions and generalisations.

A Brahmagupta triangle is a triangle whose side lengths are consecutive positive integers and area is a positive integer. The triangle whose side lengths are 3, 4, 5 is a Brahagupta 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 who gave a list of the first eight such triangles without explaining the method by which he computed that list.

References

1 2 R. Spira, The diophantine equation $x 2 + y 2 + z 2 = m 2$ , Amer. Math. Monthly Vol. 69 (1962), No. 5, 360–365.
↑ R. A. Beauregard and E. R. Suryanarayan, Pythagorean boxes, Math. Magazine 74 (2001), 222–227.
↑ R.D. Carmichael, Diophantine Analysis, New York: John Wiley & Sons, 1915.
↑ L.E. Dickson, Some relations between the theory of numbers and other branches of mathematics, in Villat (Henri), ed., Conférence générale, Comptes rendus du Congrès international des mathématiciens, Strasbourg, Toulouse, 1921, pp. 41–56; reprint Nendeln/Liechtenstein: Kraus Reprint Limited, 1967; Collected Works 2, pp. 579–594.
↑ Sierpiński, Wacław, Pythagorean Triangles , Dover, 2003 (orig. 1962), p.102–103.
↑ MacHale, Des, and van den Bosch, Christian, "Generalising a result about Pythagorean triples", Mathematical Gazette 96, March 2012, pp. 91-96.
↑ "OEIS A005818". The On-Line Encyclopedia of Integer Sequences.
↑ "OEIS A367737". The On-Line Encyclopedia of Integer Sequences.
↑ J. Cremona, Letter to the Editor, Amer. Math. Monthly 94 (1987), 757–758.

External links

Weisstein, Eric W. "Pythagorean Quadruple". MathWorld .
Weisstein, Eric W. "Lebesgue's Identity". MathWorld .
Carmichael. Diophantine Analysis at Project Gutenberg

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[Spira-1] 1 2 R. Spira, The diophantine equation $x 2 + y 2 + z 2 = m 2$ , Amer. Math. Monthly Vol. 69 (1962), No. 5, 360–365.

[2] R. A. Beauregard and E. R. Suryanarayan, Pythagorean boxes, Math. Magazine 74 (2001), 222–227.

[3] R.D. Carmichael, Diophantine Analysis, New York: John Wiley & Sons, 1915.

[4] L.E. Dickson, Some relations between the theory of numbers and other branches of mathematics, in Villat (Henri), ed., Conférence générale, Comptes rendus du Congrès international des mathématiciens, Strasbourg, Toulouse, 1921, pp. 41–56; reprint Nendeln/Liechtenstein: Kraus Reprint Limited, 1967; Collected Works 2, pp. 579–594.

[5] Sierpiński, Wacław, Pythagorean Triangles , Dover, 2003 (orig. 1962), p.102–103.

[6] MacHale, Des, and van den Bosch, Christian, "Generalising a result about Pythagorean triples", Mathematical Gazette 96, March 2012, pp. 91-96.

[7] "OEIS A005818". The On-Line Encyclopedia of Integer Sequences.

[8] "OEIS A367737". The On-Line Encyclopedia of Integer Sequences.

[9] J. Cremona, Letter to the Editor, Amer. Math. Monthly 94 (1987), 757–758.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]