# Pythagorean Triples

Alexander Bisant, *Howard Community College 2016, University of Maryland Baltimore County*

Kyle Sutton, *Howard Community College 2016, University of Maryland Baltimore County*

Mentored by: Mike Long, Ed.D. & Loretta FitzGerald Tokoly, Ph.D.

**Abstract**

*It was noticed while observing a specific subset of the Pythagorean Triples, that Triangular Numbers, positive integers which are the sum of the first “n” positive integers, were implicitly appearing in the Pythagorean Triples. This led to the question and proof that Triangular Numbers can be used to generate a subset of the Primitive Pythagorean Triples. An immediate extension was if Triangular Numbers could be used to generate all of the Primitive Pythagorean Triples. A method was found for generating all of the Primitive Pythagorean Triples, along with some non-Primitive Triples as well, using an argument that actually ties back to the work of Euclid already mentioned. A second argument can be made to filter out those Triples that are not primitive.*

**Introduction**

Since the time of the Plimpton 322 (1800 B. C.) when they were discovered etched in clay tablets, Pythagorean Triples, sets of three positive integers *A*, *B*, and *C*, where , have captured the interest of mathematicians. Migrating many years later and many miles away, Euclid came up with an elegant proof to generate all of the Primitive Pythagorean Triples. These are Triples where the mentioned integers, a, b, and c, have a greatest common divisor of one. That interest in Pythagorean Triples has migrated around the globe and has been mentioned in the work of countless mathematicians.

Even today, interest in and exploration of Pythagorean Triples, which is the focus of this research, remains alive. Initially, it was observed with Pythagorean Triples in the list shown (see Figure 1), that each of the middle numbers, which represents the length of the longer leg of the right triangle, is always four times a Triangular Number. It was also observed that the shorter leg was an odd number and the hypotenuse was one more than the longer leg. The research question that emerged was whether all of the Primitive Pythagorean Triples could be generated using the Triangular Numbers in one way or another.

**Background**

A Pythagorean Triple is a set of three unique positive integers A, B, and C for which the following is true:

where A and B are the legs of a right triangle and C is the hypotenuse of that right triangle. For a triple to be considered “primitive”, the three integers must be pairwise relatively prime, or each pair has a greatest common divisor of 1, .

Probably the most well-known method for generating a complete covering of primitive Pythagorean Triples is the formula first introduced by Euclid around 300 BC. Euclid’s formula involves two positive, relatively prime integers, m and n, where n” src=”https://howardcc.instructure.com/equation_images/m%253En” alt=”LaTeX: m>n” data-equation-content=”m>n” data-mathml=”$mgt;n$“>m > n and m − n is odd (in other words, one of the integers is odd and the other even).

Euclid’s formula defines the three sides of the triangle, , , and , as:

**Initial Research Findings**

For the infinite set of primitive triples, there exists a subset of primitive triples for which the difference of C and B is one. This subset of primitive triples is listed in ascending order based on the value of A in Figure 2. The list of triples for n = 1 through n = 5 is identical to the list of triples in Figure 1 that led to the initial question.

m | n | |||

2 | 1 | 3 | 4 | 5 |

3 | 2 | 5 | 12 | 13 |

4 | 3 | 7 | 24 | 25 |

5 | 4 | 9 | 40 | 41 |

6 | 5 | 11 | 60 | 61 |

It should be noted that all of the ’s in Figure 2 are all multiples of 4. It can be easily shown that is always a multiple of four, where m is a natural number greater than or equal to 2. Since either m or m − 1 must be even, either or is a product of 2 and an even number. Therefore, B is a multiple of four because the product of 2 and any even number is a multiple of four. Consequently, each B in the ordered subset of primitive triples represented by Figure 2 can be divided by four and results in the following sequence: 1,3,6,10,15,… This sequence is the same as the sequence produced by the formula , which generates the sum of the first natural numbers or the Triangular Numbers.

Further Research Findings

The first subset examined was defined by the difference of C* *and A being 2 and is in Figure 3.

The triples of this set have the following properties for k ∈ W:

; 4 times a triangular number, 1 , plus a multiple of ); the product of two odd numbers that differ by 2 = 2 ( 1 ) ; plus 2 times a square number,

The second subset examined was defined by the difference of C and A being 8 and is in Figure 4:

The triples of this set have the following properties for k ∈ W :

4 times a triangular number, plus a multiple of the product of two odd numbers that differ by A k plus 2 times a square number,

The third subset examined was defined by the difference of and being 18 and is in Figure 5.

The triples of this set have the following properties for :

4 times a triangular number, , plus a multiple of ; A k = ( 2 the product of two odd numbers that differ by 6 = 2 ( 3 ) ; A k plus 2 times a square number, 9 = 3 2.

It should be noted that this method does pick up some Pythagorean Triples that are not primitive. In Figure 5, the triple 27, 36, 45 is not primitive. But, is a multiple (9 times) of the Primitive Pythagorean Triple 3, 4, 5.

The fourth subset examined was defined by the difference of and being 32 and is in Figure 6.

The triples of this set have the following properties for k ∈ W :

4 times a triangular number, , plus a multiple of the product of two odd numbers that differ by A k plus 2 times a square number, .

The fifth subset examined was defined by the difference of C and A being 50 and is in Figure 7.

The triples in this set have the following properties for

4 times a triangular number, , plus a multiple of the product of two odd numbers that differ by 1 A k plus 2 times a square number, .

While it was originally thought that a single index could be used from the original example (see Figure 2), from observing the behavior in each of the subsets (Figures 3-7) it was discerned that second index, the *n*, would be needed. In fact, it was realized that a double index would be needed to realize a method for generating a covering of the primitive Pythagorean Triples.

The double index method that encompasses the behaviors observed is as follows:

where , and and are relatively prime. An algabraic proof can be used to show that every set of and is a Pythagorean Triple.

Algebraic Proof

This shows that the , , and , which were defined using the triangular numbers, can be used to generate Pythagorean Triples. Furthermore, it would be useful to show that this generator produces a covering of the Primitive Pythagorean Triples. To prove this, the , , and will be related to Euclid’s formula, which does provide a covering of the Primitive Pythagorean Triples.

As mentioned previously, Euclid’s formula uses two positive, co-prime integers m e and n e, where n_e” src=”https://howardcc.instructure.com/equation_images/m_e%253En_e” alt=”LaTeX: m_e>n_e” data-equation-content=”m_e>n_e” data-mathml=”${m}_{e}gt;{n}_{e}$“> and is odd. Using and , Euclid’s formula defines , , and , as:

The first step in relating the new method with Euclid’s formula is to determine if and can be written in the same form as and respectively.

It appears as though and n, from the new method, are equal to the and from Euclid’s formula respectively. Proving that this is in true is the next step in relating the new method to Euclid’s formula and is done below.

Proof m e = 2 k + 1 + 1 and n e = n

Suppose and where and n ∈ N. First, it must be shown that and are positive integers. From the supposition, and are the sums of the products of nonnegative integers. Thus, and are integers. The smallest possible values of and are 0 and 1 respectively. Let and . Then and . Since and are positive integers when and are their smallest values, and will be positive integers for any values of and . It must also be shown that n_e” src=”https://howardcc.instructure.com/equation_images/m_e%253En_e” alt=”LaTeX: m_e>n_e” data-equation-content=”m_e>n_e” data-mathml=”${m}_{e}gt;{n}_{e}$“>. The smallest possible value of is 0. Let Then . Since the smallest value of results in a positive value for , by the definition of odd, will always be a positive odd integer. Suppose n_e” src=”https://howardcc.instructure.com/equation_images/m_e%253En_e” alt=”LaTeX: m_e>n_e” data-equation-content=”m_e>n_e” data-mathml=”${m}_{e}gt;{n}_{e}$“>. Then, n_e” src=”https://howardcc.instructure.com/equation_images/m_e%253En_e” alt=”LaTeX: m_e>n_e” data-equation-content=”m_e>n_e” data-mathml=”${m}_{e}gt;{n}_{e}$“> so n” src=”https://howardcc.instructure.com/equation_images/2k%252B1%252Bn%253En” alt=”LaTeX: 2k+1+n>n” data-equation-content=”2k+1+n>n” data-mathml=”$2k+1+ngt;n$“> and 0″ src=”https://howardcc.instructure.com/equation_images/2k%252B1%253E0″ alt=”LaTeX: 2k+1>0″ data-equation-content=”2k+1>0″ data-mathml=”$2k+1gt;0$“>Since is a positive odd integer it will always be greater than 0. Therefore, n_e” src=”https://howardcc.instructure.com/equation_images/m_e%253En_e” alt=”LaTeX: m_e>n_e” data-equation-content=”m_e>n_e” data-mathml=”${m}_{e}gt;{n}_{e}$“>.

Further, it must also be shown that is odd for and to have opposite parity. The smallest possible value of is 0. Let . Then . Since the smallest value of k results in a positive value for , by the definition of odd, will always be a positive odd integer. Thus, and so is a positive odd integer.

This all shows that and from the new method are equal to the and from Euclid’s formula, respectively.

The final step in relating the new method to Euclid’s formula is to prove that the requirement that and be relatively prime for the new method to generate primitive triples is equivalent to the requirement that and be relatively prime for Euclid’s formula to generate primitive triples.

Proof that m e and n e being relatively prime is logically equivalent to k + 1 and n being relatively prime.

Let and have a greatest common divisor . Then and where , , and . Thus, ) and Since is the sum of natural numbers, . Therefore, and are products of and some natural number, and respectively. In addition, because ,

Thus, and are relatively prime if, and only if, and are relatively prime.

Summary

The results in this paper answer the question of whether triangular numbers can be used to generate Primitive Pythagorean Triples. It was shown that a double index was necessary for such a formula to generate Primitive Pythagorean Triples. It was also shown that this generating formula provides a covering of the Primitive Triples by relating the formula to that of Euclid. Further inquiry will investigate a sieve for separating the triples that are generated.

**Contact: ** rn28456@umbc.edu, ksutton1@umbc.edu