Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Pythagorean triple"

m (expand a bit)
(→‎Common Pythagorean Triples: Fixed one primitive triple, which did not have the code <nowiki>*</nowiki>)
 
(15 intermediate revisions by 7 users not shown)
Line 1: Line 1:
−
A '''Pythagorean Triple''' is a triple of [[positive integer]]s, <math>(a, b, c)</math> such that <math>a^2 + b^2 = c^2</math>.  Pythagorean Triples arise in [[geometry]], as the side-lengths of [[right triangle]]s.
+
A '''Pythagorean triple''' is a triple of [[positive integer]]s, <math>(a, b, c)</math> such that <math>a^2 + b^2 = c^2</math>.  Pythagorean triples arise in [[geometry]] as the side-lengths of [[right triangle]]s.
  
 
== Common Pythagorean Triples ==
 
== Common Pythagorean Triples ==
−
These are some common Pythagorean Triples:
+
These are some common Pythagorean triples:
 +
<nowiki>*</nowiki>=Primitive (see below)
  
−
(3, 4, 5)
+
For more pythagorean triples, see the [[Primitive Pythagorean Triple]] page.
  
−
(20, 21, 29)
+
<math>(3, 4, 5)</math><nowiki>*</nowiki>
  
−
(11, 60, 61)
+
<math>(5, 12, 13)</math><nowiki>*</nowiki>
  
−
(13, 84, 85)
+
<math>(6, 8, 10)</math>
  
−
(5, 12, 13)
+
<math>(7, 24, 25)</math><nowiki>*</nowiki>
  
−
(12, 35, 37)
+
<math>(8, 15, 17)</math> <nowiki>*</nowiki>
  
−
(16, 63, 65)
+
<math>(9, 12, 15)</math>
  
−
(36, 77, 85)
+
<math>(9, 40, 41)</math> <nowiki>*</nowiki>
  
−
(8, 15, 17)
+
<math>(20, 21, 29)</math><nowiki>*</nowiki>
  
−
(9, 40, 41)
+
<math>(11, 60, 61)</math><nowiki>*</nowiki>
  
−
(33, 56, 65)
+
<math>(13, 84, 85)</math><nowiki>*</nowiki>
  
−
(39, 80, 89)
+
<math>(12, 35, 37)</math> <nowiki>*</nowiki>
  
−
(7, 24, 25)
+
<math>(16, 63, 65)</math><nowiki>*</nowiki>
  
−
(28, 45, 53)
+
<math>(36, 77, 85)</math><nowiki>*</nowiki>
  
−
(48, 55, 73)
+
<math>(33, 56, 65)</math> <nowiki>*</nowiki>
  
−
(65, 72, 97)
+
<math>(39, 80, 89)</math><nowiki>*</nowiki>
 +
 
 +
<math>(28, 45, 53)</math><nowiki>*</nowiki>
 +
 
 +
<math>(48, 55, 73)</math> <nowiki>*</nowiki>
 +
 
 +
<math>(65, 72, 97)</math><nowiki>*</nowiki>
 +
 
 +
== Pythagorean Triangles ==
 +
Each positive integer solution of the [[diophantine equation]] <math>a^2 + b^2 = c^2</math> defining the Pythagorean triples satisfies <math>a, b < c < a + b</math>.  Thus, any triple of positive integers satisfying this equation also satisfies the [[triangle inequality]], so the solutions correspond to right triangles with integral side lengths.
  
 
== Primitive Pythagorean Triples ==
 
== Primitive Pythagorean Triples ==
−
A Pythagorean Triple is primitive if it has no common factors, so that they are [[relatively prime]]. All of the above are primitive. Multiples of the above triples will also satisfy <math>a^2 + b^2 = c^2</math>; for example, any three numbers in the form of <math>(3x, 4x, 5x)</math>, like <math>(6, 8, 10)</math>, will also satisfy it.
+
 
 +
A Pythagorean triple is called ''primitive'' if its three members have no common [[divisor]]s, so that they are [[relatively prime]]. Some triples listed above are primitive. Integral [[multiple]]s of Pythagorean triples will also satisfy <math>a^2 + b^2 = c^2</math>, but they will not form primitive triples.  For example, all triples of integers of the form <math>(3n, 4n, 5n)</math>, such as <math>(6, 8, 10)</math>, are Pythagorean triples.
 +
 
 +
=== General Form of Primitive Pythagorean Triples ===
 +
 
 +
'''Theorem.''' A triple of integers is a primitive Pythagorean triple if and only if it may be written in the form <math>(m^2-n^2, 2mn, m^2 + n^2)</math> or <math>(2mn, m^2-n^2, m^2+n^2)</math>, where <math>m > n</math> are relatively prime positive integers of different [[parity]].
 +
 
 +
==== Proof ====
 +
 
 +
Let <math>(a,b,c)</math> be a primitive Pythagorean triple.  If <math>a</math> and <math>b</math> both odd, then we must have
 +
<cmath> c^2 \equiv a^2 + b^2 \equiv 1+1 \equiv 2 \pmod{4}, </cmath>
 +
which is a contradiction, since 2 is not a [[quadratic residue | square]] [[modulus | mod]] 4.  Hence at least one of <math>a</math> and <math>b</math>, say <math>b</math>, is even.  Then <math>a</math> must be odd, since <math>a</math> and <math>b</math> must be relatively prime.  It follows that <math>c</math> is odd as well.  It follows that the numbers <math>s = (c+a)/2</math> and <math>d = (c-a)/2</math> are positive integers.  These positive integers must be relatively prime, since any common divisor of <math>s</math> and <math>d</math> must divide both <math>s+d= c</math> and <math>s-d = a</math>.  Since <math>a = s-d</math> and <math>c= s+d</math>, it follows that
 +
<cmath> b = \sqrt{c^2 -a^2} = \sqrt{(s+d)^2 - (s-d)^2} = \sqrt{4sd} = 2\sqrt{sd} . </cmath>
 +
Since <math>\sqrt{sd} = b/2</math> must be an integer and <math>s</math> and <math>d</math> are relatively prime, it follows that <math>s</math> and <math>d</math> are perfect squares.  Hence we may denote <math>s= m^2</math> and <math>d = n^2</math> for integers <math>m</math> and <math>n</math>.  Since <math>m^2 + n^2 = s+d = c</math> is odd, it follows that <math>m^2</math> and <math>n^2</math> must have different parity, so <math>m</math> and <math>n</math> have different parity.  Finally, we observe that
 +
<cmath> (m^2-n^2)^2 + (2mn)^2 = m^4 + 2m^2n^2 + n^4 = (m^2+n^2)^2, </cmath>
 +
so any triple of the form specified in the theorem is a Pythagorean triple; it must furthermore be a primitive Pythagorean triple, since any common factor of <math>m^2 - n^2</math> and <math>m^2 + n^2</math> (both of which are odd integers, since <math>m</math> and <math>n</math> have different parity) must also be a factor of both <math>(m^2 + n^2) + (m^2-n^2) = 2m^2</math> and <math>(m^2+n^2) - (m^2 - n^2) = 2n^2</math>, which are integers with no common factor greater than 2. <math>\blacksquare</math>
  
 
== See also ==
 
== See also ==
 
* [[Pythagorean Theorem]]
 
* [[Pythagorean Theorem]]
 
* [[Diophantine equation]]
 
* [[Diophantine equation]]
 +
 +
 +
[[Category:Geometry]]

Latest revision as of 15:45, 1 August 2020

A Pythagorean triple is a triple of positive integers, $(a, b, c)$ such that $a^2 + b^2 = c^2$. Pythagorean triples arise in geometry as the side-lengths of right triangles.

Common Pythagorean Triples

These are some common Pythagorean triples: *=Primitive (see below)

For more pythagorean triples, see the Primitive Pythagorean Triple page.

$(3, 4, 5)$*

$(5, 12, 13)$*

$(6, 8, 10)$

$(7, 24, 25)$*

$(8, 15, 17)$ *

$(9, 12, 15)$

$(9, 40, 41)$ *

$(20, 21, 29)$*

$(11, 60, 61)$*

$(13, 84, 85)$*

$(12, 35, 37)$ *

$(16, 63, 65)$*

$(36, 77, 85)$*

$(33, 56, 65)$ *

$(39, 80, 89)$*

$(28, 45, 53)$*

$(48, 55, 73)$ *

$(65, 72, 97)$*

Pythagorean Triangles

Each positive integer solution of the diophantine equation $a^2 + b^2 = c^2$ defining the Pythagorean triples satisfies $a, b < c < a + b$. Thus, any triple of positive integers satisfying this equation also satisfies the triangle inequality, so the solutions correspond to right triangles with integral side lengths.

Primitive Pythagorean Triples

A Pythagorean triple is called primitive if its three members have no common divisors, so that they are relatively prime. Some triples listed above are primitive. Integral multiples of Pythagorean triples will also satisfy $a^2 + b^2 = c^2$, but they will not form primitive triples. For example, all triples of integers of the form $(3n, 4n, 5n)$, such as $(6, 8, 10)$, are Pythagorean triples.

General Form of Primitive Pythagorean Triples

Theorem. A triple of integers is a primitive Pythagorean triple if and only if it may be written in the form $(m^2-n^2, 2mn, m^2 + n^2)$ or $(2mn, m^2-n^2, m^2+n^2)$, where $m > n$ are relatively prime positive integers of different parity.

Proof

Let $(a,b,c)$ be a primitive Pythagorean triple. If $a$ and $b$ both odd, then we must have \[c^2 \equiv a^2 + b^2 \equiv 1+1 \equiv 2 \pmod{4},\] which is a contradiction, since 2 is not a square mod 4. Hence at least one of $a$ and $b$, say $b$, is even. Then $a$ must be odd, since $a$ and $b$ must be relatively prime. It follows that $c$ is odd as well. It follows that the numbers $s = (c+a)/2$ and $d = (c-a)/2$ are positive integers. These positive integers must be relatively prime, since any common divisor of $s$ and $d$ must divide both $s+d= c$ and $s-d = a$. Since $a = s-d$ and $c= s+d$, it follows that \[b = \sqrt{c^2 -a^2} = \sqrt{(s+d)^2 - (s-d)^2} = \sqrt{4sd} = 2\sqrt{sd} .\] Since $\sqrt{sd} = b/2$ must be an integer and $s$ and $d$ are relatively prime, it follows that $s$ and $d$ are perfect squares. Hence we may denote $s= m^2$ and $d = n^2$ for integers $m$ and $n$. Since $m^2 + n^2 = s+d = c$ is odd, it follows that $m^2$ and $n^2$ must have different parity, so $m$ and $n$ have different parity. Finally, we observe that \[(m^2-n^2)^2 + (2mn)^2 = m^4 + 2m^2n^2 + n^4 = (m^2+n^2)^2,\] so any triple of the form specified in the theorem is a Pythagorean triple; it must furthermore be a primitive Pythagorean triple, since any common factor of $m^2 - n^2$ and $m^2 + n^2$ (both of which are odd integers, since $m$ and $n$ have different parity) must also be a factor of both $(m^2 + n^2) + (m^2-n^2) = 2m^2$ and $(m^2+n^2) - (m^2 - n^2) = 2n^2$, which are integers with no common factor greater than 2. $\blacksquare$

See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Pythagorean_triple&oldid=130151"