Pythagorean Triples, Quadruples.

, Generalization and Extension Topics

CHAPTER I: Pythagorean Triples

DEFINITION 1.1 The Pythagorean Theorem expressed as a 2+ b2=c 2, where a, b, and

c stands for the measurement of a right triangle.

DEFINITION 1.2 Pythagorean triple are set of ordered triples with positive integer

values satisfying a 2+ b2=c 2.

DEFINITION 1.3 A Pythagorean triple is a basic if other triples were derived from it

by multiplying a constant g and a basis of other triples, the

derived triples are called as non - basic (i.e, 3,4, 5 can be

become 6,8,10).
Theorem 1.1: If a, b, c are triples then are ga , gb , gc are also triples

PROOF:

Given that a 2+ b2=c 2 and multiplying a perfect square g2 would

lead to ga a2 + g2 b2=g 2 c 2 and can be rewritten as (ga)2+(gb)2=(gc )2. Therefore,

ga , gb , gc are also triples.

As illustrated:

2 2 2
a + b =c

(a ¿ ¿ 2+ b ) g =c ( g ) ¿
2 2 2 2

2 2 2 2 2 2
g a + g b =g c

2 2 2
(ga) +(gb) =(gc )
Theorem 1.2: A basic Pythagorean Triple with a a prime or odd integers is given

by:

2 2 2 2
2 a −1 a +1
a +( ) =( ) with c-b=1
2 2

a b c

DERIVATION:

The identity derived were found through mathematical observation

and the derivation of shorter method will be shown later as we progress and be

more elementary in level of approach.

It can be inferred, in the illustration as shown ( n and n+1 are

relatively prime integers)

2 2 2 2
1 −0 =1 3 −2 =5 The difference of squares follows 1,3, 5, ...

2 2 2 2
2 −1 =3 4 −3 =7 7, 9,… a pattern in the form of 2n+1.

The occurrence can be explained by: (n+1)2−n 2=2 n+1

Then, there exist a perfect square in the form of 2n+1 as such that 2n+1=a 2
2 2
a −1 a +1
. Consequently, n= and n+1= . Then, the following result will hold:
2 2

2 2 2 2
a +1 a −1 2
( ) −( ) =a
2 2

2 2 2 2
2 a −1 a +1
a +( ) =( )
2 2
 Furthermore, by the virtue of Theorem 1.1 in order to remove fraction,

multiplying it by 2 would result to:

2 2 2 2 2
(2 a) +(a −1) =(a +1)

Since, a 2 belongs to odd integers, then a is odd and for integers greater

than 2, a prime can be found in the list of odd numbers.

In showing that the solution is an identity

2 2 2 2
2 a −1 a +1
a +( ) =( ) 2 2
(2 a) +(a −1) =(a +1)
2 2 2
2 2
2 4 2 4 2
2
4 2
a −2 a +1 a +2 a +1
4 2 4 a +a −2 a +1=a +2 a +1
a+ =
4 4 4 2 4 2
a +2 a +1=a +2 a +1
4 2 4 2
a + 2 a + 1 a +2 a +1
=
4 4

Then, the following from above are called identities.

Theorem 1.3: A basic and non – basic triples whose general solution is given by:

2 2 2 2 2 2
2 a −n a +n
a +( ) =( ) , with c-b=n
2n 2n

a b c

A reader at this point on basis with the method of Theorem 1.2

could try out for c-b=2 and (n+ 2)2−n 2 so on and so forth but the infinite number
 of integers makes it impractical to have different differences so a general solution

is needed.

Anyways, if one wishes to continue the method of Theorem 1.2,

then he or she could arrive at this:

2 2 2 2
2 a −4 a +4
a +( ) =( )
4 4 (i.e. 6 2+8 2=102, 162 +63 2=652,etc. )
2 2 2 2
2 a −9 a +9
a +( ) =( ) (i.e. 152 +362 =392, 282 +722=75 2,etc. )
6 6
2 2 2 2
2 a −16 a +16
a +( ) =( ) (i.e. 1 62 +302=34 2, 24 2+70 2=742 ,etc. )
8 8

…..

With c-b= {2,3,4,…}

A sharp – eyed reader could notice that:

2 2 2 2
2 a −4 a +4
a +( ) =( ) 4¿ 22 ,2 ( 2 )=4
4 4
2 2 2 2
2 a −9 a +9
a +( ) =( )
6 6
2 2 2 2
2 a −16 a +16 9¿ 32 , 2 ( 3 )=6
a +( ) =( )
8 8

…..

16¿ 4 2 ,2 ( 4 )=8
 2 2 2 2 2 2
a −n a +n
A guess can be made that a 2+( ) =( ) and can be
2n 2n

easily verified as an identity.

2 2 2 2 2 2
2 a −n a +n
a +( ) =( )
2n 2n
4 2 2 4 4 2 2 4
2 a −2 a n +n a +2 a n + n
a+ =
4 4
4 2 2 4 4 2 2 4
a +2a n +n a +2a n +n
=
4 4

A proof and simple derivation can be done with fewer steps and

through elementary operations.

FORMAL DERIVATION:

1. 2.

2 2 2
a + b =c c−b=n

2 2 2
a =c −b c=n+b

2 2
2 a −n
a =( c−b )( c+b ) c= +n
2n

2 2
a +n
a 2=n ( n+2 b ) c=
2n

2
a
n+2 b=
n
 2
a
2 b= −n
n

2 2
a −n
b=
2n

2 2 2 2 2 2
a −n a +n
Thus, we arrive at a 2+( ) =( ) , with c-b=n (Fractional
2n 2n

Identity)

Furthermore, by the use of Theorem 1.1 we also arrive at

2 2 2 2 2 2 2
(2 an) +( a −n ) =( a +n ) or what we call as (Integer Identity)

Going back in Theorem 1.2, the reader could see that

2 2 2
3 + 4 =5 Substituting x from the set of 1

2 2 2
5 +12 =13 to infinity the three Pythagorean functions

2 2 2
7 +2 4 =25 could generate the result. The following

2 2 2
9 + 40 =41 result prompts the definition in Theorem 1.4

2 2 2
11 +60 =61

f(x)=2x+1 f(x)=2x2+2x f(x)=2x2+2x+1

We define f(x)=a, b, c where f(x)=a=fx+g and f(x) = b and f(x)=c

Theorem 1.4a: If a, b, and c are triples, the following operation on a,b, and

c are valid.

1. c−b=n
2
a
2. c +b= .
n
4 4
a −n
3. bc= 2
4n

4. If a=f ( x ) , f ( x )=fx+ g , f ≠1∧0 , f ranges over

positive integers.

a. If gcd ( f , g )=1 , thenn=1, giventhat 2 divides f .

b. If gcd ( f , g )=1 ,∧gcd ( f , 2 )=1, then , f ( x ) is invalid.

c. If gcd ( f , g )=h , then gcd ( hf , hg )=1 , then proceed ∈a

PROOF:

1. Settling n as the difference of c and b and defined as c-b in

previous theorems are purely evident and needs not to be

proven true.

2. This property can be verified in two ways. One way to show its
2 2 2 2
a −n a +n
true is to add b and c expressing it as + equates to
2n 2n
 2
a
. The other way around is showing that a 2=( c−b )( c+b ) then
n
2
a
c +b= knowing that c-b=n.
n
2 2 4 4
a +n a −n
3. Knowing b and c then bc=¿ )( ) then bc= 2
2n 4n

4. As indicated in Theorem 1.3 for a of the form 2x+1

It is safe to assume that a and b are relatively prime integers.

2 2
a ±n
Note that b and c takes in the form of and 2 in the
2n

denominator restricts value in the numerator as a 2 must be

divisible by 2 to allow complete division. Then, ( fx+ g )2 must

be divisible by 2, the last term g2 is ignored for awhile as

2 2
g −n .

Another one that affects the numerator and the numerator is n

and indicates that ( fx+ g )2 must be divisible by n thus leaving

2 2
g −n to be examined for the divisibility of 2n. It follows for

each cases.

Case 1: If gcd ( f , g )=1 ,and 2 divides f , then n=1

Given that f ∧g are relatively prime integers and f is

divisible by 2 then g must be an odd integer. If g is an odd

integer then also its square is an odd integer. It should be noted

that n is also the divisor and g2−n2 is divisible by 2 and n is an

odd integer then among the set of odd integers only 1 could

meet the condition. Thus, prove.

 Case 2: If gcd ( f , g )=1, 2 does not divide f , f >1, then

f (x) is invalid.

There is no problem that f and g are relatively prime

integers but a contradiction would arise if it is not divisible by

2 since it was shown that f must be divisible by 2. Anyways, if

one wishes to continue and would arrive at fractions there are

certain integers in regular intervals but are not consecutive (i.e.

1,2,3,4,…) and therefore not the actual function.

f
Case 3: If gcd ( f , g )=h, then for any a, b, and c where >1
g

is a least fraction (ha)2 +( hb)2=( hc)2 applies with h

must not be equal to 1 or 0.

f g
If gcd ( f , g )=h ,then gcd ⁡( , )=1. Express fx+ gin lowest
h h

terms.

Apply the rules as established in Cases 1 and 2.

To help the reader to have a clearer idea then an illustration is

helpful.

Illustration:

` If the a= f(x) and f(x)=4x+3, determine the other two functions b,

and c.
Let a= 4x+3 with gcd(4,3)=1 and 2 divides 4 then n=1

By performing the operations as shown in Theorem 1.3 , f(x)=a, b, c

would correspond to f(x)=4x+3, 8x2+12x+4, 8x2+12x+5

For x={1,2,3,4,5}

72+242=252 112+602=612 152+1122=1132

192+1802=1812 232+2642=2652

If the a= f(x)=3x+1, determine the other two functions b, and c.

Let a= 3x+1 with gcd (3,1)=1 and 2 does not 3 then fx+g is invalid, if we

9 2 9
continue f(x)=a,b, c would correspond to f(x)=3x+1, x +3x, x2+3x+1
2 2

(we continue to show that a is invalid). Some values of n can make a,b, c

assume integer values not having fractions and they are alternately

occurring. Instead of 3x+1, 6x+1 best more describe and more concise.

If a=f(x)=4x+6, determine the other functions f(x) for b and c.

Let a=4x+6 and become reduce to 2x+3 the we have temporary a as 2x+3

then by performing f(x)=2x+3, 2x2+6x+4, 2x2+6x+5 and our actual f(x) is

not 2x+3, we multiply it back by 2 then we should arrive at f(x)= 4x+6,

4x2+12x+8, 4x2+12x+10.

In general manner, if we let f(x) be any polynomial we define the

following in Theorem 1.4b.

Theorem 1.4b: If a function is to be a polynomial then the following are valid.

1. a=f ( x ) , f the coefficent of the highest degree∧g be a constant where f must must

not be 0 and ranges over positive integers..

a. If gcd ( f , g )=1 , thenn=1, giventhat 2 divides f .

b. If gcd ( f , g )=1 ,∧gcd ( f , 2 )=1, then , f ( x ) is invalid.

c. If gcd ( f , g )=h , then gcd ( hf , hg )=1 , then proceed ∈a

In here, we let a be a function for triples a, b, and c.

A reader at this level would like to explore more properties

regarding the triples but at this moment we toss it aside and regain our

momentum later as the next one answer what makes a triple to be a basic

which was incompletely established in Theorem 1.2 in which there are

more integers that are relatively prime other than n, and n+1. In here we

will use, Theorem 1.3 to give the requirements.

Theorem 1.5: A triple is said to be basic if and only if a 1 and n1 are relatively

prime integers or if a1 is odd then n1 is even and vice versa.

 PROOF:

In here we will use the integer identity:(2 an)2+( a2−n2 )2=(a2 +n2 )2.

We set the condition of being odd or even. The expression 2 anis

automatically even while a 2 ± n2 are both odd and by that the triple

becomes irreducible. The problem not all odd integers and even integers

are irreducible (i.e. 3 and 6) and thus we must add relatively prime.

Theorem 1.6: If a is prime then there exist only one corresponding values of b

and c such that they are triples.

PROOF:

Knowing that the triple takes on the form of

2 2 2 2 2 2
2 a −n a +n
a +( ) =( ) . If a is to be prime greater than 2 then its square is
2n 2n

an odd integer. To have integer values, a 2−n2 must be divisible by 2 and a

square odd diminished by 1 is divisible by 2 and we select n among the

factors of a. Being a prime, only 1 and itself are its factors and if n is itself

that would make the expression become 0. Then, only 1 is the candidate

for n. Subtraction of an odd integer by 1 means that the number becomes

divisible by 2. If there’s only one value for n, then there exist only one

corresponding values for b and c. Thus, prove.

Theorem 1.7: If a is composite there exist finitely many corresponding values of

b and c such that they are triples.

PROOF:

Integer a is composite if and only if its factors are greater than 2.

With a lot of choices for n as with factors of a then there are many

corresponding values of b and c and since the number of factors are finite

then there are finitely many corresponding values of b and c. Thus, prove.

2 2 2 2 2 2
2a −n a +n
It is to be noted that the identity a +( ) =( ) gives
2n 2n

problems in generating triples as of its fractional form and we would use

2 2 2 2 2 2 2
(2 a1 n1 ) +(a1 −n1 ) =(a1 +n1 ) . Also, dealing with fractions could often

result in mistakes such that in preceeding sections its later form is used.

The use of the identity in fraction would only be used to expressed

differences in the simplest manner.

Theorem 1.8: In a basic triple, only one of the triples is an even number.

PROOF:

By the virtue of Theorem 1.5 that a and n must be relatively prime

integers then it follows that ¿ Integer 2an is evidently an even number and

it follows that if a and n are relatively prime integers then a 2 ± n2 is an odd

integer.
Theorem 1.9: The product of triples a, b, c are divisible by 12.

PROOF:

The product of triples abc is(2 a1 n1 )(a12−n 12 )(a12 +n12 ) which is a

multiplicative operation. From Theorem 1.5, if either of a and n are odd or

even then, 2 a1 n1 must be divisible by 4. What is left is for the divisibility

of 3.

Case 1: a 1 is odd and n1 is even, relatively prime integers and 3 does not

divide a1

Integers that are odd and not divisible by 3 is of the form 6n-1 and

6n-5 and are even takes in the form of 6n-2 and 6n-4.

1. (6n-1)2-(6m-4)2=36n2-12n+1-(36m2-48m+16)= 36n2-12n-36m2-48m-15

which is exactly divisible by 3.

2. (6n-1)2-(6m-2)2=36n2-12n+1-(36m2-24m+4)= 36n2-12n-36m2-24m-3

which is exactly divisible by 3.

3. (6n-5)2-(6m-4)2=36n2-60n+25-(36m2-48m+16)= 36n2-60n-36m2-

48m+9 which is exactly divisible by 3.

4. (6n-5)2-(6m-2)2=36n2-60n+25-(36m2-24m+4)= 36n2-60n-36m2-

24m+21 which is exactly divisible by 3.

It was shown that a 12 −n12 is divisible by 3 and 2 a1 n1 divisible by 4

then abc must be divisible by 12.

Case 2: There are odd integers that are multiples of 3 and assumes the

value of n, with 2 a1 n1 is automatically divisible by 12.

 Case 2: For nonbasic triples, the rule for basic triples is to be adapted.

Since, nonbasic can be derived by multiplying by constant g and thus

does not affect the divisibility of 12.

To close the confusion if the difference is a perfect square then from the

integer identity c-a= difference and if its twice a perfect square then

c-b=n

Theorem 1.10: If the difference of the first two triples is m and n1 not defined as the

difference of c and b, then a=n+ √ 2 n2−m .

DERIVATION:

A triple is of the form (2 an)2+( a2−n2 )2=( a2 +n2 )2

2 2
2 a−a +n =m
2 2
a −2 an+m−n =0

2n+ √(−2 n) −4 (1 )( m−n )

2 2
a=
2

a=n+ √ 2 n2−m

Illustration: Determine a triple x, y, z such that x+y is at its minimum

with a difference of 8
 2 2 2 2 2 2
a −n a +n
With the two identities: a 2+( ) =( ) with c-b=n
2n 2n
2 2 2 2 2 2 2
(2 an) +( a −n ) =( a +n ) with c-b=2n2

Integer 8 is of the form 2n2 and from that we have n=2. Operating

√2 n 1
2
−m with 2n2=8 would lead to √ 8−m and to be minimum mm=7
then the least value of m. Consequently, √ 1 equates to 1. With m=7 the
value of a 1=n1 + √ 2 n12−mwould be 3. Then, by the integer identity:

2 2 2 2 2 2 2
(2 an) +( a −n ) =(a +n )
2 2 2 2 2 2 2
(2 ∙3 ∙ 2) +(3 −2 ) =(3 + 2 )
2 2 2
12 +5 =13

A reader at this level may question the real nature of the

differences in which Theorem 1.11 rules.

Theorem 1.11 A triple differences where a and n and n is the difference between c

and b, then the following rules would apply

1. b−a=(a1−n1 )2−2 n12

2. c−b=2 n12

3. c−a=(a1 −n1)2
 DERIVATION:

1. b−a=( a1 −n1 )−2 a1 n 1=a1 −2 a1 n1−n1

2 2 2 2

2 2 2 2 2
¿ a 1 −2 a1 n 1+ n1 −2 n1 =(a1−n1 ) −2 n1

2. c−b=( a1 +n1 ) −( a 1 −n1 )=2 n1

2 2 2 2 2

3. c−a=( a1 +n1 ) −2 a1 n 1=¿

2 2

PROOF

From here onwards, using the fractional identity would be

complicated and impractical to use, we shall use the Integer Identity. To

avoid confusion,regarding a,b, and c this would prompt the following

Definition.

DEFINITION 1.4 A triple is defined as a=2 a1 n1 ,b=a 2−n2 , c=a 2+ n2 and a or the

first triple must be an even integer.

Theorem 1.12: The difference of triples in arrangements is of the form
2 2 2
n , 2 n ,∨k n for some k .

We take for example as 112 +60 2=612 in which a, b, c are arranged

in increasing values and reader may notice the 61 – 60=1 or 12 but if we

see a as even and as a first triple this would be 61-11= 50 or 2 ∙5 2 and

same observations would apply to other basic triples. For proof, please

refer to Theorem 1.11.

Therefore, by this Theorem, then it is impossible to have a

difference of not in a form of n2 , 2 n2 ,∨k n2. This part plays a vital role in

the process. By any chance, the arrangements would occur then the n in

the fractional identity is identical to either c-a or c-b in the Integer

Identity. The best illustration as follows:

2 2 2 2 2 2
2 7 −1 7 +1
7 +( ) =( ) with c-b=1 or 12
1∙2 1 ∙2

2 2 2 2 2 2 2
(2 ∙3 ∙ 4) +(4 −3 ) =( 4 +3 ) with c-b=18 or 2 ∙3 2

Which could be observe all similar to 72+242=252

 Illustration: Determine a triple x,y, and z such that x+y is a minimum

with a difference of 9

The difference is on the form of a perfect square and thus must be

derived from the Fractional Identity then by the Theorems 1.11 and 1.12,
2
(a−n) =9 then a-n=3 which indicates that a must be greater than 3. To

have a minimum value, n1 must be chosen as 1 such that its product is

itself, with n as 1 and a1 as 4 by Theorem 1.5 then the triple must be basic

by substitution.

2 2 2 2 2 2 2
(2 ∙ 4 ∙ 1) +(4 −1 ) =(4 +1 )

2 2 2
8 +15 =17

Arrangements would lead to 152 +82 =172, and by fractional

identity.

2 2 2 2 2 2
2 15 −9 15 +7
15 +( ) =( )
2∙9 2∙9

And thus making (15,8,17) a minimum integer whose difference is

9.
 The application of Theorem 1.11 and 1.12 also applies to

restriction. As shown, which is useful in construction of tables and

minimizing triangles.

To aid the reader to navigate through the whole chapter, the table as shown:

Basic Pythagorean Triples within Restrictions 1 – 1200

1 – 100 101 – 200 201 - 300 301 - 400

2 2 2 2 2 2 2 2 2 2 2 2
3 + 4 =5 20 +99 =101 32 +255 =257 36 +323 =325

2 2 2 2 2 2 2 2 2 2 2 2
8 +15 =5 24 +143 =14 5 60 +221 =229 76 +357 =365

2 2 2 2 2 2 2 2 2 2 2 2
12 +35 =37 28 +195 =197 68 +285 =293 136 +273 =305

2 2 2 2 2 2 2 2 2 2 2
16+63 =65 44 +117 =125 84 + 187 =205 152 +345 =377

2 2 2 2 2 2 2 2 2 2 2 2
5 +12 =13 52 +165 =173 96 + 247 =265 180 +299 =349

2 2 2 2 2 2 2 2 2 2 2 2
20 +21 =29 60 +91 =109 120 +209 =241 204 + 253 =325

2 2 2 2 2 2 2 2 2 2 2 2
28 + 45 =53 88 +105 =137 140 +171 =221 228 +325 =397

2 2 2 2 2 2 2 2 2 2 2 2
36 +77 =85 104 +153 =185 160 +231 =281 207 +224 =305

2 2 2 2 2 2 2 2 2 2 2 2
7 +24 =25 119 +120 =169 133 +156 =205 252 +275 =373

2 2 2 2 2 2 2 2 2 2 2 2
48 + 55 =73 85 +132 =157 180 +189 =261 27 +225 =353

2 2 2 2 2 2 2 2 2 2 2 2
9 + 40 =41 15 +112 =113 147 +196 =245 175 +288 =337
 2 2 2 2 2 2 2 2 2 2 2 2
33 +56 =65 51 +140 =149 105 +208 =233 189 +340 =389

2 2 2 2 2 2 2 2 2 2 2 2
65 +72 =97 95 +168 =193 161 +240 =289 75 +308 =317

2 2 2 2 2 2 2 2 2 2 2 2
11 +60 =61 17 +144 =145 115 +252 =277 135 +352 =377

2 2 2 2 2 2 2 2 2 2 2 2
39 +80 =89 57 +176 =185 21 +220 =221 25 +312 =313

2 2 2 2 2 2 2 2 2 2 2 2
1 3 + 84 =85 19 +180 =181 69 +260 =269 27 +364 =365

2 2 2
23 +264 =265

401 – 500 501 – 600 601 – 700 701 – 800

2 2 2 2 2 2 2 2 2 2 2 2
40 + 399 =401 48 + 575 =577 52 +675 =677 56 +783 =785

2 2 2 2 2 2 2 2 2 2 2 2
120 +391 =409 92 +525 =533 100 +621 =629 108 +725 =733

2 2 2 2 2 2 2 2 2 2 2 2
44 +483 =485 184 +513 =545 156 +667 =685 168 +775 =793

2 2 2 2 2 2 2 2 2 2 2 2
84 + 437 =445 220 + 459 =509 200 +609 =641 216 +713 =745

2 2 2 2 2 2 2 2 2 2 2 2
132 +475 =493 276 + 493 =565 240 +551 =601 260 +651 =701

2 2 2 2 2 2 2 2 2 2 2 2
168 + 425 =457 308 + 435 =533 300 +589 =661 364 + 627 =725

2 2 2 2 2 2 2 2 2 2 2 2
252 +405 =477 336 +377 =505 336 +527 =625 432 +665 =793

2 2 2 2 2 2 2 2 2 2 2 2
280 +351 =449 368 + 465 =593 400 + 561 =689 468 + 595 =757

2 2 2 2 2 2 2 2 2 2 2 2
297 +304 =425 396 + 403 =565 429 + 460 =629 555 +572 =797

2 2 2 2 2 2 2 2 2 2 2 2
319 +360 =481 341 +420 =541 455 + 528 =697 481 +600 =769
 2 2 2 2 2 2 2 2 2 2 2 2
261 +380 =461 279 + 440 =521 385 +552 =673 407 +624 =745

2 2 2 2 2 2 2 2 2 2 2 2
203 +396 =445 217 + 456 =505 315 +572 =653 333 +644 =725

2 2 2 2 2 2 2 2 2 2 2 2
145 + 408 =433 231 +520 =569 105 +608 =617 259 +660 =709

2 2 2 2 2 2 2 2 2 2 2 2
87 + 416 =425 165 +532 =557 185 +672 =697 273 +736 =785

2 2 2 2 2 2 2 2 2 2 2 2
155 + 468 =493 33 +544 =545 35 +612 =613 195 +748 =773

2 2 2 2 2 2 2 2 2
120 +391 =409 111 + 680 =689 39 +760 =761

2 2 2 2 2 2
29 + 420 =421 37 +684 =685

2 2 2
93 + 476 =485

2 2 2
31 +480 =481

801 – 900 901 – 1000 1001 - 1100 1101 – 1200

2 2 2 2 2 2 2 2 2 2 2 2
504 +703 =865 60 +899 =901 64 + 1023 =1025 744 + 817 =1105

2 2 2 2 2 2 2 2 2 2 2 2
116 + 837 =845 124 + 957 =965 132 +1085 =1093 47 + 1104 =1105

2 2 2 2 2 2 2 2 2 2 2 2
232 +825 =857 464 +777 =905 192 +1015 =1033 68 +1155 =1157

2 2 2 2 2 2 2 2 2 2 2 2
280 +759 =809 248 +945 =977 320 +999 =1049 204 +1147 =1165

2 2 2 2 2 2 2 2 2 2 2 2
348 +805 =877 372 +925 =997 448 + 975 =1073 264 +1073 =1105

2 2 2 2 2 2 2 2 2 2 2 2
540 +629 =829 420 + 851 =949 496 + 897 =1025 340 +1131 =1181
 2 2 2 2 2 2 2 2 2 2 2 2
429 +700 =821 580 +741 =941 620 +861 =1061 660 +989 =1189

2 2 2 2 2 2 2 2 2 2 2 2
369 +800 =881 616 +663 =905 660 +779 =1021 528 +1025 =1153

2 2 2 2 2 2 2 2 2 2 2 2
287 +816 =865 696 +697 =985 731 +780 =1069 576 +943 =1105

2 2 2 2 2 2 2 2 2 2 2 2
205 +828 =853 615 +728 =953 645 +812 =1037 704 + 903 =1145

2 2 2 2 2 2 2 2 2 2 2 2
123 +836 =845 451 +780 =901 559 +840 =1009 744 + 817 =1105

2 2 2 2 2 2 2 2 2 2 2 2
41 +840 =841 464 +777 =905 495 + 952 =1073 832 +855 =1193

4732+8642=9852 2 2 2 2 2 2
315 +988 =1037 868 +965 =1157

3872+8842=9652 2 2 2 2 2 2
45 + 1012 =1013 611 +1020 =1189

2 2 2 2 2 2
301 +900 =949 517 +1044 =1165

2 2 2 2 2 2
215 +912 =937 423 + 1064 =1145

2 2 2 2 2 2
129 +920 =929 329 +1080 =1129

2 2 2 2 2 2
43 + 924 =925 235 +1092 =1117

2 2 2
141 +1100 =1109

Illustration: Restriction by Range

Determine a triple within the range of 300-450 (inclusive) such

that its difference is 18

The difference is of the form 2 n2 and n equates to 3, along the

process round up is necessary.

 2 2
2an ≥ 300 a + n ≤ 450

2
an ≥ 150 a +9 ≤ 450

2
3a ≥ 150 a ≤ 441

a≥ 50 a≤ 21

Since the two inequalities failed to be true to all the cases, then

there is no such triple existing within the range. If a would be less than 21,

then 2an is out in the range

From that, adjustments would be needed

From this point, we shall define the following

Definition 1.5. Restriction by range pertains to all triples whose entries are within

the given range α-β

Definition 1.6. Restriction by Type pertains to all triples that are confined to be

either basic or nonbasic.

Definition 1.7. Restriction by Sum pertains to all triple that are confined to a

certain sum.

Definition 1.8. Restrriction by product pertains to all triples that are confined to a

certain product

Definition 1.9. Combinatorial restriction pertains to all restrictions that are in

combination with range, sum, type and product.

THEOREM 1.13a (Restriction by Range)

A triple within the range of α to β either inclusive or exclusive by a certain

property or a difference of p is given by :

1. Difference in the form of 2 n2 (n is not define as difference) 2an ≥ α

2 2
a + n ≤ β ( ≤ or ≥ for inclusive, < or > for exclusive)

2. Difference in the form of (a−n)2 ( n defined as difference ) 2(a-d)(d)≥ α and

2 2
a +(a−d ) ≤ β d= 2nd root of difference

3. Simple restriction without difference

2 2
2an ≥ α a +n ≤ β

With α ≤a 2−n2 ≤ β for all.

Illustration: Determine a triple with 80-600 with a difference of 2.

The difference is of the form 2 n2 and n equates to 1.

2 2
a - n >80
2 2
a + n <600 80 < 2an ¿ 600

2
a - 1>80
2
a + 1 < 600 80 < 2a ¿ 600

2
a >81
2
a <599 40 < a ¿ 300
a>9 a < 24

Then, a must have to exist between 9 and 24 at the same time to exist

between 40 and 300 which is entirely absurd and contradictory.

Then, it can be concluded that there is no triple whose entrees are on the

range that

It can be notice that if the range would become more larger, then it is less

likely to have a triple within that range in contradictory with our belief that it

would be more likely to exist in larger range.

In defining the restrictions, we derive the following:

Case 1: The difference is of the h2 within α-β

2 2
(2 an) + ( a −n ) =( a +n ) → 2 n =(a ¿ ¿ 2+ n )− ( a −n ) ¿
2 2 2 2 2 2 2 2 2

2 2
a + n −2 an=¿

a-n = h→ a-h = n

( a 2−n2 ) > α (a ¿ ¿ 2+ n )< β ¿

2

a −( a ¿ ¿ 2−2 ah+ h )> α ¿ a +(a ¿ ¿ 2−2 ah+h )< β ¿

2 2 2 2

2 2 2
2 ah−h >α 2 a −2ah−h < β

2
0 > h2 −2 ah+α (a< h+√ (2 β 〖 −h 〗 ))/2
 2
a>(h + α )/2 h

α <2 an< β

α <2 a(a−h)< β

2
α <2 a −2 ah< β

h+ √ h2 +2 α
<a< √
h+ h2+ 2 β
2 2

h+ √ h2 +2 p
If the difference ish2 , then a must exist between and
2

h+ √ h2 +2 q h+ √ h2 +2 p h+ √ h2 +2 q
at the same time at intervals and . If absurdity
2 2 2

arises and contradictory, then it can simple concluded to be void.

Case 2: The difference of the form 2 h2 within the α-β

2 2 2 2
a - n ≥α a +n ≤ β p ≤2 an ≤ β

2 2 2 2
a −h ≥ α a +h ≤ β p ≤2 ah ≤ β

p β
2 2
a ≥ h +α
2
a < β−h
2
≤a≤
2h 2h

a ≥ √ h2 +α a ≤ √ β−h2

The same conclusion goes for case 1.

Case 3: If nonbasic triple of form f h2, where f is the set of positive integers. For

the process simply divide f to p and q and proceed for case 1 or case 2, then

return it back by multiplying it again by f.

Less than→ round up Greater than → round down

Illustration:

Determine a triple with a difference of 36 within the range of 20-

400

By the use of rules for case 1 in the form of h2 with h=6, plugging

the values would result to the following intervals [5,16] and [7,17] in the

values of a.

To [7,16] considering 5, 6, and 17 to be examined later

At this point, we will enumerate the 9 triples to exist with range

( 10 = no. Of integers within 7-16).

n= a-h n= a-h Therefore, n ranges with [1,11]

= 7-6 = 17-6

=1 = 11

Enumeration of Triple

2(7)(1)2+(72 −12)2=(72 +12)2 →14 2 +482 =502

 1. 2(8)(2)2+(8 2−22)2=(82 +22 )2 → 322+60 2=682

2. 2(9)(3)2 +(9 2−32 )2=(9 2+3 2)2 → 54 2+722 =902

3. 2(10)(4)2+(102−4 2)2=(102 +4 2)2 →80 2+ 842=116 2

4. 2(11)(5)2+(112−52)2=(112+5 2)2 → 110 2+ 962=1462

5. 2(12)(6)2 +(122 −62 )2=(122 +6 2)2 → 144 2+108 2=1802

6. 2(13)(7)2 +(13 2−72 )2=(13 2+7 2)2 →1822 +1202=218 2

7. 2(14)(8)2 +(14 2−8 2)2=(142 +82 )2 → 224 2+1322=2602

8. 2(15)(9)2 +(15 2−92 )2=(15 2+ 92)2 →270 2+144 2=306 2

9. 2(16)(10)2+(16 2−102)2 =(16 2+10 2)2 → 3202 +1562=356 2

2(17)(11)2 +(17 2−112 )2=(17 2+ 112)2 →374 2 +1682=4102

With a complete list of 9

(80, 84, 116), (182, 120, 218), (32, 60, 68), (54, 72, 90), (110, 96, 146), (144,

108, 180), (182, 120, 218), (224, 132, 260), (270, 144, 306), (320, 156, 356)

If one wishes to determine the number of triples without enumerating the

triples, then first examine the lower and upper values. For example, examine 7

as the lower values if it should satisfy otherwise reject, same goes with 17.

Theorem 1.13b (Restriction by Type)

Illustration: Determine all first 10 basic triples

 From the definition in Theorem 1.5 where our solution starts.

Starting with a= 2 and n= 1, we do it by pairs.

2 2
2(2)( 1 )2 + ( 22−12 ) = ( 22+ 12) → 32+ 4 2=52

2(4)(1)2+(4 2−12 )2=( 4 2+12 )2 → 8+152=17 2

2(3)(2)2+(32−22)2=(32 +22)2 →122 +52=13 2

2(5)(2)2+(52−22)2=(52 +22)2 →202 +212=292

2(4)(3)2 +(42−32)2=(4 2 +32)2 →24 2 +72=25 2

with a complete list of 5

(3, 4, 5), (8, 15, 17), (5, 12, 13), (20, 21, 29), (7, 24, 25

Theorem 1.13c (Restriction by Sum)

The sum of a triple is always even can proved in 2 ways. Theorem 1.8

offers one such proof, it states that only one is an even number and implies that

the other are odd integers. Adding two odd numbers and an even number results

to an even integer. The second one is provided by Theorem 1.3 and can be shown:

a+b+c= 2 an+a 2−n2 +a 2−n2= 2an+2a 2= 2a(a+n)

 By the definition, if the sum is an odd integer then it is automatically

unexistent.

Illustration: Determine a triple whose sum is 100.

The sum is 100 then a(a+n) is 50. The factors of 50 includes 1, 2, 5, 10, 25

and 50.

Starting with 1 and 50,setting a as 1 then n= 49 such that 1(1+49)= 50

2 2 2 2 2 2 2
[2(1)(49)] +[1 −49 ] =[1 +49 ]

2 2 2
98 + (−2400 )= 2402

Checking: 98+(-2400)+2402= 100 and having a negative, we tend to ignore this.

Illustration: Determine a triple whose sum is 684.

The sum is 684 then a(a+n) is 342 with its factors 2, 3, 6, 9, 19, 18, 38, 57,

114, 171

2 3 6 9 18 19 38 57 114 171

From all the factors we centarlize our view at 18 and 19.

Setting a= 18 and n= 1 such that 18(18+1)= 342

 2 2 2 2 2 2 2
[2(18)(1)] +[18 −1 ] =[18 +1 ]

2 2 2
36 +323 =325

36+323+325= 684

The only triple known to exist is (36, 323, 325)

Theorem 1.13d (Restriction by Product)

The difference of a triple can be shown by:

( 2 an ) ( a 2−n2 ) ( a2 +n 2 )=( 2 an ) (a ¿ ¿ 4−n4 )¿

Here in this part can be tricky and hard to comprehend but the lies to be easy.

Illustration: Determine a triple such that its product is 66780. The integer 66780

can be expressed in factored form as

2
2 ∙3 ∙ 5∙ 7 ∙53

Automatically, the largest factor is 53 becomes the c. And 53 must be

expressed as the sum of two squares and it is easy to see that 7 and 2 exist as the

factors and 72 +22 equates to 53. Then, 22 and 7 must be paired and 32 and 5 be

paired in multiplication arriving in abc.

66780= 22 ∙5 ∙ 32 ∙ 7 ∙53
 = 22 ∙32 ∙5 ∙ 7 ∙53

= 22 ∙32 ∙5 ∙ 7 c

= 22 ∙32 ∙5 ∙ 7 ∙53

2 2
7 +2

= 22 ∙7 ∙ 32 ∙ 5 ∙53

= 28 ∙ 45 ∙53

Which is 282 + 452=532 and 28 ∙ 45 ∙53 = 66780

Determine a triple such that its product is 15540.

15540 =22 ∙5 ∙7 ∙ 3 ∙ 37

=22 ∙3 ∙ 5∙ 7 ∙ 37

5+7
=22 ∙3 ∙ 5∙ 7 ∙ 37 =6
2

2
6 +1

= 22 ∙3 ∙ 5∙ 7 ∙ 37 and 2 ∙3=6

= 12∙ 35∙ 37 (5,6) pair

Which is 122 +352=37 2 (2,3) pair

Determine a triple such that its product is 65520.

65520 =24 ∙ 5∙ 32 ∙7 ∙ 13

=24 ∙ 32 ∙ 5 ∙7 ∙ 13

= 24 ∙ 32 ∙ 5 ∙7 ∙ 13

2 2 2 2
2 +1 2 +¿ 3

= 24 ∙ 32 ∙ 7 ∙ 5∙ 13

= 16∙ 63 ∙65

Which is 162 +63 2=652

Determine a triple whose product is 453960.

453960 =23 ∙32 ∙5 ∙ 13 ∙97

2 2
9 +4

And 92 −4 2= 65 which is 5∙ 13

= 23 ∙32 ∙5 ∙ 13 ∙97

= 722 +652=972

Determine a product is 199980.

 199980 =22 ∙32 ∙5 ∙ 11∙101 10 =2∙ 5

2
10 +1

=22 ∙32 ∙5 ∙ 11∙101 2 2

10 −1=¿ 3 ∙11

2
10 +1

=22 ∙32 ∙5 ∙ 11∙101

=20 ∙ 99∙ 101

2 2 2
20 +99 =101

Determine a triple whose product is 92 820.

92 280 = 22 ∙3 ∙ 5∙ 13 ∙7 ∙ 17
2
¿ 2 ∙ 3 ∙5 ∙ 13 ∙7 ∙ 17

2 2 2 2 2 2
2 +1 2 +3 4 +1

= Groupings: 132 +84 2=852

Before checking the prime factorization, check if it is divisible by 12. If not,

the triple does not exist.

THEOREM 1.13e. Combinatorial Restriction

 As per Definition 1.9 states is a combination of sum, type, range, and

product. This part would include the integration of techniques of Theorems 1.13a

– 1.13d.

Illustration:

Combinatorial Restriction (Type, Range, and Sum)

Determine all basic triples whose sum ranges from 100 – 150.

The key point is to centralize our view using the three techniques.

In integers from 100 – 150 we only consider the even ones as the odd ones

are simply unexistent. To centralize our view efficiently, take the factor nearest to

the square root. To summarize everything.

50 – does not exist

51 – does not exisit

....

Therefore to save time, we primarily focus ourselves on 50 – 75 and its

products of it consecutively as n is greater than a. We list the the following and

knowing the restriction by type we further restrict by creating relatively prime a

and n.

7 ( 8 )=7 ( 7+1 )=not relatively prime

7 ( 10 ) =7 ( 7+3 )=not relatively prime

 6 ( 11 )=6 ( 6+5 )=relatively prime

8 ( 9 )=8 ( 8+1 )=relatively prime

7 ( 9 )=7 ( 7+2 )=relatively prime

6 ( 9 )=6 ( 6+3 )=not relatively prime

6 ( 10 ) =6 ( 6+ 4 )=not relatively prime

6 ( 12 )=6 ( 6+6 ) =not relatively prime

8 ( 8 )=8 ( 8+0 )=invalid

We permit the checked ones and thus we have:

2 2 2 2 2 2 2 2 2
60 +11 =61 16 +63 =65 28 + 45 =53

And checking the triples having the sum of 132, 144, an d 108

respectivelyare all within the range of 100 – 150.

 CHAPTER 2: Pythagorean Quadruple

DEFINITION 2.1 A Pythagorean Quadruple are set of four numbers with positive

integer values satisfying a 2+ b2 +c 2=d 2, the triple is said to be basic if other

triples are derived from it by multiplying a constant g and are irreducible as non –

basic triples.

THEOREM 2.1 If a, b, c, and d are quadruples then ga, gb, gc, and gd are also

quadruples.

Proof: a 2+ b2 +c 2=d 2

2 2 2 2 2 2
g (a + b +c )=g (d )

2 2 2 2 2 2 2 2
g a + g b + g c =g d +

THEOREM 2.2 A basic Pythagorean Quadruple is given by the formula:

2 2 2 2
a +(a+1) +[a ( a+1 ) ] =[a ( a+1 ) +1]

Where d-c=1=b-a
 The above identity was derived through mathematical observation

and the result wasn’t derived accidentally and to be discussed more cleary

inn suceeding theorems.

To show:

2 2 2 2
a +(a+1) +[a ( a+1 ) ] =[a ( a+1 ) +1]

2
a + a +2 a+1+a +2 a +a =( a + a+1 )
2 2 4 3 2 2

4 3 2 4 3 2
a +2 a +3 a +2 a+1=a +2 a +3 a +2 a+1

THEOREM 2.3 A Pythagorean Quadruple is given by the formula:

2 2
2 a ( a +n )
2 a ( a+ n )
a +(a+ n) +[ ] =[ + n]
n n

As noticed it is a more generalized form of Theorem 2.2.

To show:

2 2
a ( a +n ) a ( a+ n )
a 2+(a+ n)2 +[ ] =[ + n]
n n

2 2 2 2
a (a+n) a (a+n)
a 2+ a2 +2 an+n2 + 2
= 2
+ 2 a2+ 2 an+n2
n n

2 2 2 2
a (a+n) a (a+ n)
2 a2 +2 an+n 2+ 2
= 2
+2 a2 +2 an+n2
n n
THEOREM 2.4 The general soluton of a Pythagorean Quadruple is given by:

2 2 2 2 2 2 2 2
2 2 a +b −m a + b +m
a + b +[ ] =[ ]
2m 2m

Derivation:

2 2 2 2
a + b +c =d

2 2 2 2
a + b =d −c

2 2
a + b =( d −c )( d+ c )

2 2
a + b =( m ) ( m+ 2 c )

2 2
a +b
=m+2 c
m

2 2
a +b
−m=2 c
m

2 2 2
a +b −m
=2 c
m

2 2 2
a +b −m
=c
2m

If m = d – c

d=m+c

2 2 2
a +b −m
¿ m+
2m
 2 2 2
a + b +m
d=
2m

And now, the quadruple has been generalized.

THEOREM 2.5 The following formulas were derived from the substitution of

values in Theorem 1.4

2 2 2 2 2 2 2 2
a +(a+ n) −m
2 a +(a+ n) + m
2
Equation 1: a +(a+ n) +[ ] =[ ]
2m 2m

where b - a = n & d – c = m

By the use of theorem 2.43 we wil show Theorem 2.2-2.3

For Theorem 2.2

Set n = m = 1

2 a2 +(a+1)2−12 2 a2 +(a+1)2 +(1)2 2

2
a +(a+1) +[ ] =[ ]
2(1) 2 (1)
2 2 2 2 2 2
2 a +a +2 a+ 1−1
2 a +a +2 a+ 1+ 1
a +(a+1) +[ ] =[ ]
2 2
2 2 2 2
2 2 2a +2a 2 a +2 a+2
a +(a+1) +[ ] =[ ]
2 2
2 2 2 2 2 2
a +(a+1) +(a +a) =(a +a+ 1)
2 2
a +(a+1) +¿ ¿

For Theorem 2.3

Set d – c = n b–a=n

d=n+c b=a+n
2 2 2 2 2 2 2 2
2 2 a +b −n a +b +n
a + b +[ ] =[ ]
2n 2n
2 2 2 2 2 2 2 2
2 a +(a+ n) −n
2 a +(a+n) +n
a +(a+ n) +[ ] =[ ]
2n 2n
 2 2 2 2 2 2 2 2 2 2
2 2 a + a +2 an+n −n a +a +2 an+ n + n
a +(a+ n) +[ ] =[ ]
2n 2n
2 2 2 2 2
2 2 2 a +2 an 2 a +2 an+2 n
a +(a+ n) +[ ] =[ ]
2n 2n
2 2
2 a (a+n) a ( a+ n )
2
a +(a+ n) +[ ] =[ + n]
n n

2 2 2
a −n 2
Equation 2: a +( ) +¿¿
2n

2 2
a −1
Equation 3: a 2+( ) +¿ ¿
2

It can be seen that the other way to derive a quadruple is through a

combination of two triples as shown. If 32 + 42=5 2, and 52 +122=132 then

2 2 2 2
3 + 4 +12 =13 . In here comes Equation 2.

Derivation:

2 2
a −n
a=a b=
2n

( ) ( )
2 2 2 2 2 2 2 2
2 2 a + b −m a +b +m
a +b + =
2m 2m

[ ][ ]
2 2

( ) ( )
2 2 2 2 2 2
a +n 2 a +n 2
−m +m
( )
2 2 2
2 a −n 2n 2 n
a+ + =
2n 2m 2m

( ) +¿¿
2 2 2
a −n 2
a+
2n
 [ ][ ]
2 2 2 2
( a2+ n2 ) −4 m2 n 2 ( a2 +n2 ) + 4 m2 n 2

( )
2 2 2 2 2
2a −n 4n 4n
a+ + =
2n 2m 2m

) +[ ][ ]
2 2 2 2

( ( a2 +n2 ) −( 2mn )2 ( a 2+ n2 ) + ( 2 mn)2

2 2 2
Eq. 2. 2 a −n
a+ =
2n 8 mn
2
8 mn
2

Furthermore, by combining triples whose differences is 1 we could arrive

an Equation 3.

Eq. 3

[ ][ ]
2 2 2 2

( )
a −1 ( a −1 ) a +1 ( a −1 )
2 2 2 2 2 2
2 a −1
a+ + + = +
2 2 8 2 8

THEOREM 2.6 If a 2+ b2 is a prime there exists only one corresponding values of c

and d such that they are quadruples.

Proof:

The value of a 2+ b2is a prime with its factors 1 and itself to be selected as

n. Using the factor itself would render the numerator to be zero having 1 as the

only candidate. If there is only one choice, then there exist only one

corresponding value of c and d.

THEOREM 2.7 If a 2+ b2 is a composite there exists finitely many corresponding

values of c and d such that they are quadruples.

Proof:

A composite has factors aside from 1 and itself, then the choice for

n can be chosen from the finite list of its factors. Then, there exist

finitely many corresponding values of c and d.

Theorem 2.8. A quadruple is said to be basic if and only if a 2+ b2 is relatively

prime to n at the same time a 2+ b2 is odd, n is even, or vice versa.

Proof:

( ) ( )
2 2 2 2 2 2 2 2
a + b −m
2 2 a +b +m
The fractional identity a + b + = can be
2m 2m

2 2
transformed into ( 2 an )2 + ( 2 bm )2+ ( a2 +b2 −m2) =( a 2+ b2+ m2) and it is a basic if it

is irreducible to simplest forms then we should note that a, b, c, and d must be

relatively prime. One way to see it, is considering the odd or even. It is evident

the any of the two are even and to ensure irreducibility and the other two must be

odd. To achieve this, we set them odd or even and vice and versa. However, it is

not enough as such (i.e. 3 and 6 are both even and odd but still are reducible) and

thus we add conditions of being relatively primes.

THEOREM 2.9 The product of quadruples a, b, c, and d are exactly divisible by 12.

This fact can be verified by generating a quadruple and dividing it by 12.

A mathematial observation could be done by comparing the gcd of quadruples

which can be seen to conclude to be 12. As the observation occurs not in accident

we offer a simple proof.

It is enought to show it for basic quadrupes as nonbasic quadruples are

derived by constant f and are negligible a g can vary differently among nonbasic.

2 2 2 2 2 2
12∨(2 am)(2 abm)(a +b −m )(a +b +m )

2 2 2 2 2 2
3∨(am)(abm)(a +b −m )( a + b +m )

3∨m2 ( ab ) [ ( a2 +b 2) −m4 ]
2

To ensure the basic as indicated by Theorem 1.9 we define odd as 6n-1

and 6n-5 and even of 6n-4 and 6n-2. We define a and b to be relatively prime and

odd or even or vice cersa as it can be shown that

(2 p)2 +(2 p+1)2=4 ( n2 +m2 +m ) +1 as odd satisfying the condition and even as vice

versa.

g∨m2 ( ab ) [ ( a2 +b2 ) −m 4 ]
2

2 2
a + b → 6 n−1 m→ 6 m−2
 g∨ ( 6 m−2 )2 (2 p ) (2 p+1) [ ( 6 n−1 )2−(6 n−2) 4 ]

2 2 3 4 2
g∨ ( 6 m−2 ) (2 p ) (2 p+1)[−3+ 192m−864 m + 1728 m −1246 m −12 n+36 n ]

2
g∨(36 m −24 m+ 4)¿

And thus, divisble by 12. Sone may argue of divisibility by 36 but we

offer one counterexample.

2 2 2 2
11 +14 + 158 =159
 CHAPTER 3: GENERALIZATION AND EXTENSION TOPICS

In the previous two chapters, we only deal with triples and quadruples, how about

if we extend it to pentuples or as we like. In here, we deal the generalized idea of k –

ples. We will define k as the number of terms and define triple as 3 – ple with k = 3 and

quadruple as 4 – ple.

To introduce and start the topic, we would like to show the following.

2 2 2
3 – ple 3 + 4 =5

2 2 2 2
4 – ple 2 +3 +6 =7

2 2 2 2 2
5 – ple 3 + 4 +6 +30 =31

2 2 2 2 2 2
6 – ple 1 +2 +3 +5 +19 =20

2 2 8 2 2 2
7 –ple 2 +4 +6 +10 +54 =56

2 2 2 2 2 2 2 2
8 – ple 5 +6 +7 + 8 + 9 +10 +33 =38

2 2 2 2 2 2 2 2 2
9 – ple 3 + 4 +5 +6 +7 + 8 + 9 +69 =71

2 2 2 2 2 2 2 2 2 2
10 – ple 1 +2 +3 +4 + 5 + 6 +7 +8 +14 =20

2 2 2 2 2 2 2 2 2 2 2
11 – ple 1 +3 +5 +7 +9 +11 +13 +15 +17 + 160 =163
 2 2 2 2 2 2 2 2 2 2 2 2
12 – ple 1 +2 +3 +4 + 5 + 6 +7 +8 + 9 +10 + 36 =41

DEFINITION 3.1 The Pythagorean k – ple expressed as a 12 + a22+ …+a k−12=ak 2 for

some integer k where a 1, a 2, ..., a k assume positive integer values.

We define k to be greater than 2.

THEOREM 3.1 If a 1, a 2, ..., a k are k – ples, then ga1, ga 2, ...,g a k are also k – ples.

PROOF:

2 2 2 2 2
a 1 + a2 + a3 +… .+a k−1 =ak

g2 ( a 12 +a 22+ a32+ … .+a k−12 ) =g2 (a k 2)

2 2 2 2 2 2 2 2 2 2
g a1 + g a2 + g a 3 + … .+ g a k−1 =g ak

2 2 2 2 2
(g a1 ) +( g a2 ) +(g a3 ) +…+(g ak−1 ) =( g a k )

To [7,16] considering 5, 6, and 17 to be examined later

At this point, we will enumirate the 9 triples to exist with range ( 10 = no.

Of integers within 7-16)

n= a-h n= a-h Therefore, n ranges with [1,10]

= 7-6 = 16-6

=1 = 10
THEOREM 3.2 The general solution for Pythagorean k – ples is given by:

Fractional Identity:

k −2 k−2
2 2
∑ ak 2−m2 ∑ ak 2 +m2
a 12 + a22+ a32 +…+( i=1 ) =( i=1 )
2m 2m

where a k −a k −1=m

Integer Identity:

2 2 2
(2 a¿¿ 1 m) +(2 a¿¿ 1 m) +(2 a¿ ¿ 1m) + …+¿ ¿ ¿ ¿=¿

DERIVATION:

2 2 2 2 2
a 1 + a2 + a3 +… .+a k−1 =ak

2 2 2 2 2 2
a 1 + a2 + a3 +… .+a k−2 =ak −ak −1

k −2

∑ ak 2=(a k −¿ ak −1 )(a k + ak−1 )¿

i=1

k −2

∑ ak 2=m ( m+2 ak−1 )

i=1

k−2

∑ ak 2
i=1
=m+2 ak −1
m

k−2

∑ ak 2
i=1
−m=2 a k−1
m
 k−2

∑ ak 2−m2
i=1
=2 a k−1
m

k−2

∑ ak 2−m2
i=1
=ak−1
2m

a k −a k−1=m

a k =a k−1+ m

k−2

∑ ak 2−m2
a k = i=1 +m
2m

k−2

∑ ak 2 +m2
a k = i=1
2m

Furthermore, we have the integer identity:

k−2 k−2
2 2
(2 a1 n)2+(2 a2 n)2+(2 a3 n)2+[ ∑ a k2 −n2 ] =[ ∑ ak 2 +n2 ]
i=1 i=1

THEOREM 3.3 If k gets larger then the number of basoc k – ples are increased.

Proof:

We can select any integer freely without bound in integers a 1,a 2 .

,until a k−2. From that selection, all of the integers would be mostly

relatively prime to each other thus becoming irreducible.

 And now, we are ready to tackle some of the of the extension

topics and some problems.

In here, we will tackle this problem. Suppose that a triangle

has a hypotenuse with a length of c and side a and b would change

to have different areas while maintaining the length of the

hypotenuse in which is equivalent to finding the integer solutions

of a 2+ b2=c 2 +d 2 .

In here, we will have Theorem 3.4

THEOREM 3.4 The integer solutions of a 2+ b2=c 2 +d 2 is given by the identity by

the identity.

2 2 2 2 2 2
[2q ( p+ r ) ] +[r ( r+ 2 p )−q ] =[2qp ] +[r ( r +2 p ) +q ]

` Derivation:

The method to derive the identity lies in the author’s separate paper

“Study on Identity: Algebra –Number Theory” which we would we never discuss

in this paper due to its broad concepts which would be found to be unrelated to

the topic and we will use the paper conveniently.

2 2 2 2
a + b =c +d

2 2 2 2
a −c =d −b

(a-c)(a+c)=(d-b)(d+b)

n(n+2c)=m(m+2b)
 n ( n+2 c )
=m+ 2b
m

n ( n+2 c )
−m=2 b
m

2
n ( n+2 c )−m
=2 b
m

2
n ( n+2 c )−m
b=
2m

d-b=m

d=b+m

2
n ( n+2 c )−m
d=m+
2m

2
n ( n+ 2c ) +m
d=
2m

2 2
2 n ( n+ 2c ) −m
a +[ ] =c2 +¿
2m

a-c=n then a=n+c

2 2
2 n ( n+2 c )−m
(n+ c) +[ ] =c 2+ ¿
2m

For convinience, we apply Theorem 1.1.

 2 2 2 2 2 2
[2m ( n+c ) ] +[n ( n+2 c )−m ] =(2 mc) +[n ( n+2 c )+ m ]

And let m=q, p=n, and r=c

2 2 2 2 2 2
[2q ( p+ r ) ] +[r ( r+ 2 p )−q ] =[2qp ] +[r ( r +2 p ) +q ]

And now, we will try to generate two sides of a triangle with different of

the same hypotenuse.

We let q=2, p=3, and r=4.

2 2 2 2 2 2
[2∙ 2 ( 3+4 ) ] +[3 (3+ 2∙ 4 )−2 ] =[2∙ 2 ∙ 4] +[3 ( 3+2 ∙ 4 )+ 2 ]

so we have 282 +292=162 +372

with an area of 406 with an area of 296

√ 1625
√ 1625
28
16

29
37

And from that the hypotenuse is not an integer then if we strictly

implement we can do a transformation to have a hypotenuse assuming an integer

value.

With an area of 46 284 With an area of 658 896

1625 1113 1625

57

1624
 Theorem 3.4 only provides the integer solution of f a 2+ b2=c 2 +d 2 and not

ensuring the hypotenuse to have integer values. But if we strictly implement the

integer values then we have Theorem 3.5

THEOREM 3.5 The simultaneous integer solution of a 2+ b2=x 2 and c 2 +d 2=¿ x 2 is

given by for some integer p, q, r.

2 2 2
a=[2 q ( p+r )] −[r ( r +2 p )−q ]

2
b=4 qr ( p+ r ) (r +2 p−q )

2 2 2
x=[2 q ( p+ r ) ] +[r ( r+ 2 p )−q ]

2 2 2
c=[2 qp] −[r ( r + 2 p ) +q ]

2
d=4 pqr (r +2 p+q )

2 2 2
x=[2 qp ] +[r ( r +2 p )+ q ]

DERIVATION:

Going back Theorem 1.3 we know the integer solution of a 2+ b2=x 2 and
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
c +d =¿ x are (a −n ) +(2 an) =( a +n ) and (c −m ) +(2 cm) =(c +m ) as

shown.

2 2
2
a + b =x
2 2
( a 2−n2 ) + ( 2 an )2= ( a2 +n2 )
 2 2 2 2 2 2 2 2 2 2
c +d =¿ x (c −m ) +(2 cm) =(c +m )

We have x 2=x 2 so we need to solve for a 2+ n2=c 2 +m2 and by the

use of Theorem 3.4

2 2 2 2 2 2 2 2 2 2
a + n =c +m [2q ( p+ r ) ] +[r ( r+ 2 p )−q ] =[2qp ] +[r ( r +2 p ) +q ]

Going back from the top

2 2
2 2
a + b =x
2
( a 2−n2 ) + ( 2 an )2= ( a2 +n2 )

2 2 2 2 2 2 2 2 2 2
c +d =¿ x (c −m ) +(2 cm) =(c +m )

From that we have the following values.

2 2 2 2 2
a=a −n =[2q ( p+ r ) ] -[r ( r+ 2 p )−q ]

b=2 an=2 [2 q ( p+r ) ][r ( r +2 p )−q 2 ¿=4 qr ( p +r ) (r +2 p−q2 )

2 2 2 2 2
x=a + n =[2 q ( p+r ) ] +[r ( r+ 2 p )−q ]

2 2 2 2 2
c=c −m =c=[2 qp ] −[r ( r +2 p ) +q ]

2
d=2 cm=d=4 pqr (r +2 p +q )

2 2 2 2 2
x=c +m =x=[2qp ] +[r ( r +2 p ) +q ]

The transformation can be explained as follows.

 The (28, 29, √ 1625) (292−282 , 2 ∙28 ∙ 29 ,1625 ¿

(57,1624,1625)

The (16, 37,√ 1625) (372 −162 ,2 ∙ 37∙ 16 , 1625 ¿

(1113, 1184,1625)

How about a given length of a hypotenuse and we are tasked to vary its

area? This is what Theorem 3.6 rules.

THEOREM 3.6 The length of the hypotenuse x to be expressed as a sum of two

squares in two ways namely a 12 +b 12=c 1 and a 22 +b 22=c 2 thus we

define

2 2 2 2
a=a 1 −b1 c=a2 −b 2

b=2 a1 b1 d=2 a2 b 2

And reduce the hypotenuse by prime factorization as non – basic triples

The following method was derived from a technique coming from

Theorem 3.5 but we will just reverse the process.

ILLUSTRATION:

The length of the hypotenuse is 65 units, if the area is to be varied,

determine all sides of the triangles.

65=82 +12=42 +7 2

2 2 2 2
8 +1 =4 +7
 a 1=8 ,∧b1=1 a 2=7 ,∧b2=4

2 2 2 2
a=8 −1 =63 c=7 −4 =33

b=2 ∙1 ∙ 8=16 d=2∙ 7 ∙ 4=56

Therefore, we have 162 +63 2=652and 2 2 2

33 +56 =65 as two triangles.

However, they are basic triples and we have non – basic as well then there exist

other two and we express 65 in prime factorization and express as the sum of two

squares.

65=5∙ 13

65=( 22 +12 )( 22+3 2 )

Remember in Theorem 1, that if a,b, and c to triples then ga, gb, and gc

are also triples we will apply this concept in reverse process.

2 2 2 2 2 2
a 3 +b 3 =5 a 4 +b 4 =13

2 2 2 2 2 2
3 + 4 =5 5 +12 =13

2 2 2 2 2 2
39 +52 =65 25 +60 =65

Or we can show the squares as follows.

2 2 2 2 2 2 2 2 2 2
(2 ∙2 ∙ 1) +( 2 −1 ) =(2 +1 ) 3 + 4 =5

2 2 2 2 2 2 2 2 2 2
(2 ∙3 ∙ 2) +(3 −2 ) =(3 + 2 ) 5 +12 =13
 At last we have such 4 triangles having 65 as the hypotenuse: (16,63,65),

(33,56,65),(39,52,65), and (25,60,65) triangle.

At this point, we will discuss the quadruples with the illustration.

The distance of A to B is defined as the longest

diagonal of the box which would be the

measurement
A
d given by a 2+ b2 +c 2=d 2

a B

c
b

In here, we will tackle the another problem. Supposed that the longest

diagonal measure “d” units with length, height, and width of measurements a, b,

and c to have integer values. If a, b, and c were to be varied while maintaining the

length of d. It can be shown in Theorem 3.7

THEOREM 3.7 The integer solutions of a 2+ b2 +c 2=d 2 +e 2+ f 2 is given by the

identity for some integers p, m, d, n, and e.

a=2 p ( n+ d )
 b=2 p ( m+e )

2
c=n ( n+2 d )+ m ( m+2 e )− p

d=2 pd

e=2 pe

f =n ( n+2 d ) +m ( m+ 2 e ) + p2

DERIVATION:

2 2 2 2 2 2
a + b +c =d +e + f

2 2 2 2 2 2
a −d +b −e =f −c

( a−d ) ( a+ d )+ ( b−e ) ( b+ e )= ( f −c ) (f + c)

n ( n+2 d ) +m ( m+ 2 e )= p (p +2 c)

n ( n+2 d ) +m ( m+2 e )
=p +2 c
p

2
n ( n+2 d ) +m ( m+2 e )− p
=2 c
p

2
n ( n+2 d ) +m ( m+ 2 e )− p
c=
2p

f −c= p

f = p+c
 2
n ( n+2 d ) +m ( m+2 e )− p
f = p+
2p

2
n ( n+2 d ) +m ( m+2 e ) + p
f=
2p

a−d=n

a=n+ d

b−e=m

b=m+e

2 2 2 2
2 2 n ( n+2 d )+ m ( m+2 e )− p n ( n+ 2d )+ m ( m+2 e ) + p
(n+ d) +(m+ e) +[ ] =d 2 +e 2+[ ]
2p 2p

Therefore, by removing the fractions using Theorem 1.1, we have the

following values

a=2 p ( n+ d )

b=2 p ( m+e )

2
c=n ( n+2 d )+ m ( m+2 e )− p

d=2 pd

e=2 pe

2
f =n ( n+2 d ) +m ( m+ 2 e ) + p

If we implement strictly all lengths to be integers, we have Theorem 3.8.

THEOREM 3.8 The simultaneous integer solution of a 2+ b2 +c 2=¿and

2 2 2 2
d +e + f =¿ x is given by for some integer p, m, n, d, and e.

2
a=4 p ( n+ d ) [n ( n+2 d ) +m ( m+2 e )− p ]

2
b=4 p (m+c)[n ( n+2 d ) +m ( m+ 2 e ) −p ]

c=4 p2 [ ( n+d )2 + ( m+c )2 ]−[n ( n+2 d )+ m ( m+2 e )− p2 ]2

2
d=4 pd [n ( n+2 d ) +m ( m+2 e ) + p ]

2
e=4 pe[n ( n+2 d ) +m ( m+ 2 e ) + p ]

f =4 p [ d + e ]−[n ( n+2 d )+ m ( m+2 e )+ p ]

2 2 2 2 2

DERIVATION

2 2 2 2 2 2 2 2 2 2 2 2 2 2
a + b +c =x (2 an) +(2 bn) +(a + b −n ) =(a +b + n )

2 2 2 2 2 2 2 2 2 2 2 2 2 2
d +e + f =¿ x (2 bm) +( 2 em) +( d + e −m ) =( d + e +m )

If x 2=x 2 , then a 2+ b2 +n2=d 2 +e 2+ m2

 2 2 2 2 2 2
a + b +n =d +e + m

a=2 p ( n+ d ) d=2 pd

b=2 p ( m+e ) e=2 pe

2
n=n ( n+2 d ) +m ( m+2 e )− p

2
m=n ( n+ 2 d )+ m ( m+2 e )+ p

Going back from the top

2 2 2 2 2 2 2 2 2 2 2 2 2 2
a + b +c =x (2 an) +(2 bn) +(a + b −n ) =(a +b + n )

2 2 2 2 2 2 2 2 2 2 2 2 2 2
d +e + f =¿ x (2 dm) +(2 em) +( d + e −m ) =(d + e +m )

a=2 an=2 [ 2 p ( n+d ) ] [n ( n+2 d ) +m ( m+2 e )− p ]

2

¿ 4 p ( n+ d ) [n ( n+2 d ) +m ( m+2 e )− p2 ]

b=2 bn=¿ 2[2 p ( m+ e ) ][n ( n+2 d ) +m ( m+ 2 e )− p 2 ¿

= 4 p (m+c) [n ( n+ 2d ) + m ( m+2 e ) −p 2 ]

2 2 2
c=a +b −n

2 2 2 2
¿ [2 p ( n+d ) ] +[2 p ( m+ e ) ] −[n ( n+2 d ) +m ( m+ 2e )− p ]

= 4 p 2 [ ( n+ d )2+ ( m+ c )2 ]−[n ( n+2 d ) +m ( m+ 2 e )− p 2] 2

 d=2 dm=2 ( 2 pd ) [n ( n+ 2 d )+ m ( m+2 e )+ p 2]

=4 pd [ n ( n+2 d ) +m ( m+ 2 e ) + p2 ]

e=2 em=2 ( 2 pe ) [ n ( n+2 d ) +m ( m+2 e ) + p 2 ]

=4 pe [n ( n+2 d ) +m ( m+2 e ) + p2 ]

2 2 2 2 2 2 2
f =d +e −m =(2 pd ) +(2 pe ) −[ ( n+2 d ) +m ( m+ 2e ) + p ]

Going past the topic and we go beyond to the basis of dimensional figures,

we will tackle about the generalizations of this type of equations.

THEOREM 3.9 The integer solutions of a 12 + a22+ …+a k 2=b12 +b22 +…+ bk 2 is given

by for some integer.

 a 1=2 d k (b1 +d 1 ) b 1=2 d k b 1

a 2=2 d k (b2 +d 2 ) b 2=2 d k b 2

... ...

a k−1=2 d k (b k−1 + d k−1) b k−1=2 d k b k−1

k−1
a k =∑ d k ( d k +2 b k )−d k2
i=1

k−1
b k =∑ d k ( d k +2 b k ) +d k 2
i=1

DERIVATION:

2 2 2 2 2 2
a 1 + a2 + …+a k =b1 +b2 +…+ bk

2 2 2 2 2 2 2 2
a 1 −b1 +a2 −b 2 + …+a k−1 −bk−1 =b k −a k

( a 1−b1 ) ( a1+ b1 ) + ( a 2−b2 ) ( a2+ b2 ) +…+ ( a k−1 −bk−1 ) ( a k−1+ bk−1 )=( bk −ak ) (bk +a k )

d 1 ( d 1 +2 b1 ) +d 2 ( d 2+ 2b 2 ) +d 3 ( d 3 +2 b3 ) +…+ d k−1 ( d k−1 +2 b k−1) =d k (d k + 2 ak )

k −1

∑ d k ( d k + 2b k )=d k (d k +2 ak )
i=1

k−1

∑ d k (d k +2 b k )
i=1
=d k +2 a k
dk
 k−1

∑ d k (d k +2 b k )
i=1
−d k =2 ak
dk

k−1

∑ d k ( d k +2 bk ) −d k 2
i=1
=2 ak
dk

k−1

∑ d k ( d k +2 bk ) −d k 2
a k = i=1
2 dk

b k −a k =d k

b k =a k + d k

k−1

∑ d k ( d k +2 bk ) −d k 2
b k = i=1 + dk
2 dk

k−1

∑ d k ( d k +2 bk ) + d k 2
b k = i=1
2d k

a 1−b1=d 1

a 1=b1 +d 1

a k−1−b k−1 =d k−1

a k−1=b k−1 +d k−1

 k−1 k−1
2 2
∑ d k ( d k +2 bk ) −d k ∑ dk (
2 2 2 i=1
(b 1+ d 1) +(b 2+ d 2) +…+(b k−1+ d k−1) +[ ] =b1 +b2 +…+ bk−1 +[ i=1
2 2 2
2 dk

2 2
[ 2 d k ( b1 +d 1 ) ] + [ 2 d k ( b 2+ d 2 ) ] + …+¿ ¿

Therefore, we have the following integer values.

a 1=2 d k (b1 +d 1 ) b 1=2 d k b 1

a 2=2 d k (b2 +d 2 ) b 2=2 d k b 2

... ...

a k−1=2 d k (b k−1 + d k−1) b k−1=2 d k b k−1

k−1
a k =∑ d k ( d k +2 b k )−d k2
i=1

k−1
b k =∑ d k ( d k +2 b k ) +d k 2
i=1

THEOREM 3.10 The integer solutions of the simultaneous equation:

2 2 2 2 2 2 2 2
a 1 + a2 + …+a k =x and b 1 +b 2 + …+bk =x
 a 1=[ 4 p ( b1 +d 1 ) ] ¿]

a 2=[ 4 p ( b2 +d 2 ) ] ¿]

...

a k−1=[ 4 p ( bk−1 +d k−1 ) ] ¿]

k−1
2
a k =4 p ¿-[ ∑ d k ( d k +2 bk ) −p ]
2 2

i=1

b 1= [ 4 p b 1 ] ¿

b 2= [ 4 p b 2 ] ¿

...

b k−1=[ 4 p b k−1 ] ¿

k−1
2
b k =4 p ¿ -[ ∑ d k ( d k +2 bk ) + p ]
2 2

i=1

DERIVATION:

2 2 2 2
a 1 + a2 + …+a k =x

2 2 2 2
b 1 +b 2 + …+bk =x

2 2 2
(2 a¿¿ 1 n) +(2 a¿¿ 2 n) +(2 a¿ ¿ 3 n) +…+ ¿ ¿ ¿¿ =¿

2 2 2
(2 b¿¿ 1 n) +(2 b¿¿ 2 n) +(2 b¿ ¿3 n) +…+¿ ¿ ¿ ¿ =¿
 k −1 k−1

∑ ak +n =∑ bk 2 +m2
2 2

i=1 i=1

2 2 2 2 2 2 2 2 2 2
a 1 + a2 + a3 +…+a k−1 + n =b1 +b 2 +b 3 + …+b k−1 +m

2 2 2 2 2 2 2 2
a 1 −b1 +a2 −b 2 + …+a k−1 −bk−1 =m −n

( a 1−b1 ) ( a1+ b1 ) + ( a 2−b2 ) ( a2+ b2 ) +…+ ( a k−1 −bk−1 ) ( a k−1+ bk−1 )=( m−n ) (m+n)

d 1 ( d 1 +2 b1 ) + d 2 ( d 2+2 b 2) + …+d k−1 ( d k−1 +2 bk−1 )= p ( p +2 n)

k −1

∑ d k (d k +2 bk )= p( p+ 2n)
i=1

k−1

∑ d k (d k +2 b k )
i=1
= p+2 n
p

k−1

∑ d k ( d k + 2 bk )− p 2
n= i =1
2p

m−n= p

m= p+ n

k−1

∑ d k ( d k +2 b k )− p2
m= p+ i=1
2p

k−1

∑ d k ( d k +2 b k )+ p 2
m= i=1
2p

a 1−b1=d 1
 a 1=b1 +d 1

...

a k−1−b k−1 =d k−1

a k−1=b k−1 +d k−1

k−1 k−1
2 2
∑ d k ( d k +2 bk ) −p 2 ∑ d k ( d k + 2 bk ) + p2
(b 1+ d 1)2 +(b 2+ d 2)2 +…+(b k−1+ d k−1)2 +[ i=1 ] =b12 +b22 +…+ bk−12+[ i =1 ]
2p 2p

2 2
[ 2 p ( b1 +d 1 ) ] +[ 2 p ( b2 +d 2 ) ] + …+¿ ¿

a 1=2 p (b1 +d 1 ) b 1=2 p b 1

a 2=2 p (b2 +d 2 ) b 2=2 p b 2

... ...

a k−1=2 p (bk −1 +d k −1 ) b k−1=2 p b k−1

k−1
n=∑ d k ( d k +2 bk ) − p2
i=1

k−1
m=∑ d k ( d k + 2b k ) + p2
i=1

Therefore, having completed the values we give the following integer solutions:

Going back from the top

 2 2 2 2
a 1 + a2 + …+a k =x

2 2 2 2
b 1 +b 2 + …+bk =x

2 2 2
(2 a¿¿ 1 n) +(2 a¿¿ 2 n) +(2 a¿ ¿ 3 n) +…+ ¿ ¿ ¿¿ =¿

2 2 2
(2 b¿¿ 1 n) +(2 b¿¿ 2 n) +(2 b¿ ¿3 n) +…+¿ ¿ ¿ ¿ =¿

[∑ ]
k−1
a 1=2 a1 n=2 [ 2 p ( b1 +d 1 ) ] d k ( d k +2 b k )− p2
i=1

[∑ ]
k−1
2
¿ 4 p (b1 +d 1 ) d k ( d k +2 bk ) −p
i=1

[∑ ]
k−1
a 2=2 a2 n=2 [ 2 p ( b2 +d 2 ) ] d k ( d k +2 b k )− p2
i=1

[∑ ]
k−1
¿ 4 p (b2 +d 2 ) d k ( d k +2 bk ) −p 2
i=1

...

[∑ ]
k−1
a k−1=4 p (bk−1 +d k −1 ) d k ( d k +2 bk ) −p 2
i=1

k−1
a k =∑ a k 2−n2=a12 +a22 +…+ ak−12−n2
i=1

2 2
¿ [ 2 p ( b1 +d 1 ) ] + [ 2 p ( b2 +d 2 ) ] + …+¿ ¿

k−1
2
¿ 4 p ( b 1+ d 1 ) + 4 p ( b1 + d1 ) +…+ 4 p ( b k−1+ d k−1) −[ ∑ d k ( d k +2 b k )− p2 ]
2 2 2 2 2 2

i=1
 [ ]
k−1 k −1

∑ ( bk + d k )2 −[∑ d k ( d k + 2b k )− p 2]
2
¿ 4 p2
i=1 i=1

[∑ ]
k−1
b 1=2 b1 m=2(2 p b 1) d k ( d k +2 b k )+ p 2
i=1

[∑ ]
k−1
2
¿ 4 p b1 d k ( d k +2 bk ) + p
i=1

[∑ ]
k−1
2
b 2=2 b2 m=2(2 p b 2) d k ( d k +2 b k ) + p
i=1

[ ]
k−1
¿ 4 p b2 ∑ d k ( d k +2 bk ) + p2
i=1

...

[∑ ]
k−1
b k−1=2 bk−1 m=2(2 p b1) d k ( d k +2 b k ) + p2
i=1

[∑ ]
k−1
¿ 4 p b k−1 d k ( d k +2 bk ) + p2
i=1

k−1
b k =∑ a k 2−m2=b 12 +b 22+ …+b k−12−m2
i=1

k−1
2
b k =4 p ¿-[ ∑ d k ( d k +2 bk ) + p ]
2 2

i=1
THEOREM 3.11 Given that k > h , the general solution of the equation

2 2 2 2 2 2
a 1 + a2 + …+a k =¿ b 1 +b 2 + …+bh is given by the following.

a 1=¿

a 2=2 d 1(b2 +d 2 )

...

a k =2 d 1 (b k + d k )

b 1=¿

b 2=2 d 1 b 2

...

b h=2 d 1 b h

Derivation:

2 2 2 2 2 2 2 2
a 1 + a2 + a3 +…+a k =b1 +b 2 +b 3 …+ bh

2 2 2 2 2 2 2 2 2 2 2
a 1 −b1 +a2 −b 2 + a3 −b 3 + …+a k −bk =bk +1 +b k+2 +…+ bh

( a 1−b1 ) ( a1+ b1 ) + ( a 2−b2 ) ( a2+ b2 ) +…+ ( a k −bk ) ( ak +b k )=¿

 d 1 ( d 1 +2 b1 ) +d 2 ( d 2+ 2b 2 ) +…+ d k ( d k + 2b k )=¿

d 1 ( d 1 +2 b1 )=¿ ¿

d 1 ( d 1 +2 b1 )=¿

b 1=¿ ¿

a 1−b1=d 1 → a1=b 1+ d 1

∑ (¿ b k+12 +…+ bh2)−∑ d k ( d k +2 bk ) + d 12

i=2
¿ ¿
2d1

a 2−b2=d 2 → a2=b2 +d 2

a k −b k =d k → ak =bk +d k

¿¿

¿¿

Therefore, we have the integer solutions.

a 1=¿

a 2=2 d 1 ( b 2+ d 2 )

...

` a k =2 d 1 ( bk +d k )
 b 1=¿

a 2=2 d 1 ( b 2 )

...

a h=2 d 1 ( bh )

THEOREM 3.12 Given that k > h , the general solution of the simultaneous equation

2 2 2 2
a 1 + a2 + …+a k =x

2 2 2 2
b 1 +b 2 + …+bh =x is given by the following:

a 1=2 n¿

a 2=4 a1 n(b2 + d2 )

...

a k−1=4 a1 n(b k−1+ d k−1)

2
b 1=2( p+n) ¿

2
b 2=4 d 1 b 2 ( p+n )

...

2
b k−1=4 d 1 b k−1 ( p+n )

a k =¿ ¿
 b h=¿ ¿

Derivation:

2 2 2 2 2
a 1 + a2 + a3 +…+a k =x

2 2 2 2
b 1 +b 2 + …+bh =x

((2 a¿¿ 1 n)2+(2 a¿¿ 2 n)2 +(2 a¿ ¿ 3 n)2 +…+(2 a¿¿ k−1 n)2+ ¿¿ ¿ ¿ ¿ ¿

((2 b¿¿ 1 m)2 +(2 b¿¿ 2 m)2 +(2 b¿ ¿ 3 m)2+ …+( 2b ¿¿ h−1 m)2+¿ ¿ ¿ ¿ ¿ ¿

k −1 h−1

∑ a k 2 +n2 ¿ ¿=∑ b h2 +m2 ¿ ¿

i=1 i =1

2 2 2 2 2 2 2 2 2 2
a 1 + a2 + a3 +…+a k−1 + n =b1 +b 2 +b 3 + …+b h−1 +m

2 2 2 2 2 2 2 2 2 2 2 2
a 1 −b1 +a2 −b 2 + …+a k−1 −bk−1 +n =b1 + b2 + …+b h−1 +m −n

2 2 2
(a ¿ ¿ 1−b1 )(a ¿ ¿1+ b1)+(a ¿ ¿2−b2 )(a ¿ ¿2+ b2)+ …+(a ¿ ¿ k −1−b k+1 )(a ¿ ¿ k −1+b k−1)=b 1 + b2 + b3 +…+

d 1 ( d 1 +2 b1 ) +d 2 ( d 2+ 2b 2 ) +…+ d k−1 ( d k−1 +2 bk −1 ) =∑ ( b 12+ …+bh −12 ) + p( p+ 2 n)

k−1
d 1 ( d 1 +2 b1 )=∑ ( b1 +…+ bh−1 ) + p( p+2 n)−∑ d k ( d k +2 b k )
2 2

i=2

k−1

∑ ( b1 +…+ bh−1 )+ p( p+2 n)−∑ d k ( d k + 2b k )−d12

2 2

i=2
b 1=
2 d1

k−1

∑ ( b12 +…+ bh−12 )+ p ( p+ 2 n )−∑ d k ( d k +2 b k ) +d 12

i=2
a 1=
2 d1
a 2−b2=d 2 then, a 2=b2 +d 2

a k−1−b k−1 =d k−1 then, a k−1=b k−1 +d k−1

m-n = p then m= p+n

¿+n2 =¿ ¿

k−1
a 1=∑ ( b 1 + …+bh −1 ) + p ( p+2 n )−∑ d k ( d k +2 bk ) + d12
2 2

i=2

a 2=[2 d ¿ ¿ 1 ( b2 +d 2 ) ]¿

...

a k−1=[2 d ¿ ¿ 1 ( bk−1 +d k−1 ) ]¿

k−1
b 1=∑ ( b 12+ …+bh−12 ) + p ( p+2 n )−∑ d k ( d k +2 bk ) −d 12
i=2

b 2=[2 d ¿ ¿ 1b 2 ]¿

...

b h−1=[2 d ¿ ¿ 1b h−1 ]¿

m=p+n

therefore,we have the following values

a 1=2 a1 n=2 n ¿

a 2=2 a2 n=2[2 d ¿ ¿ 1 ( b2 +d 2 ) ]=4 a1 n ( b2 +d 2 ) ¿

 ...

a k−1=2 ak−1 n=4 a1 n ( b k−1+ d k−1 )

2
b 1=2 b1 m=2( p+n) ¿

2 2
b 2=2 b2 m=2( p+n) [2d ¿ ¿ 1 b2 ]=4 d 1 b 2 +( p+ n) ¿

...

2
b k−1=2 b2 m=4 d 1 b k−1 +( p+ n)

k−1
a k =∑ a k 2−n2
i=1

[∑ ( ]
k−1 2

b1 +…+b h−1 ) + p ( p+ 2n )−∑ d k ( d k +2 b k ) +d 1 + [ 2 d 1 ( b 2+ d 2 ) ] + …+ [ 2 d 1 ( bk−1 +d k−1 ) ] −n2

2 2 2 2 2
¿
i=2

[ ]
k−1 2

¿ ∑ ( b1 +…+b h−1 ) + p ( p+ 2n )−∑ d k ( d k +2 b k ) +d 1

2 2 2 2 2
+ 4 d12 ( b2 +d 2 ) +…+ 4 d12 ( b k−1 + d k−1 ) −n2
i=2

[∑ ( ]
k−1 2

¿ b1 +…+b h−1 ) + p ( p+ 2n )−∑ d k ( d k +2 b k ) +d 1 + 4 d12 ¿

2 2 2

i=2

a k =¿ ¿

h−1
b h=∑ b h2−m2
i=1

Undergoing the same process we arrive at

[∑ ]
h−1
b h= b h2−m2 =b 12+ b22+ …+b h−12 −m 2
i=1
 [ ]
k−1
¿ ∑ ( b12 +b22 +…+ bh−12 )+ p ( p +2 n )−∑ d k ( d k +2 ( bk ) )−d 12 +( 2 d 1 b2 )2 +…+( 2 d 1 bh−1 )2− ( p+ n )2
i=2

b h=¿ ¿

As an ending we will cite the following for k=h

2 2 2 2
28 +29 =16 +37

2 2 2 2 2 2
30 +36 +87 =15 +18 +96

2 2 2 2 2 2 2 2
3 +5 +7 +10 =1 + 2 +3 +13

2 2 2 2 2 2 2 2
THEOREM 3.13 If a 1 + a2 + …+a k =x1 and x 1 + x 2 +…+ x h = y

2 2 2 2 2 2
then a 1 + a2 + …+a k + x 2 +…+ x h = y

which we will define as fused k – ples.

Illustration:

If 32 + 42=5 2 and 52 +122=132

Then 32 + 42 +122=132

If 22 +32 +62 =72 and 72 +24 2=252

Then 22 +32 +62 +24 2=252

THEOREM 3.14 If a is to represent any expression in a+b 2=c 2then the general solution is
given by a+ ¿ for c – b = n

Derivation:
2 2
a+ b =c
 2 2
a=c −b

a=( c−b ) ( c+ b )

a=( n ) ( n+2 b )

a
=n+ 2b
n
2
a−n
b=
2n
2
a+ n
c=
2n

Illustrations:
4 2 2 2 3 4 5 6 2 2
1+2 !+3 + 4 =10 1 +2 +3 + 4 +5 + 8369 =8370
2
4 !+1=5
2
7 !+1=71
2
5 !+1=11
6
6 !+1=3

In denoting triples, quadrupes, and k-pes we sue the folowing notation

(a ,b ,c ),(a , b , c , d),(a 1 , a2 , a3 , … ak ) arranged in increasing orders

In denoting triples (in the form of a 2+ b2=c 2−d 2) we use the folowing notations

(a ,b : c , d ),( a , b , c : d , e , f ),(a1 , a2 ,a 3 , … a k : b1 ,b 2 , b 3 , … b k )

In denoting simultaneous-doube (in the form of a 2+ b2=x 2 and c 2 +d 2=x 2), we use the
folowing notation

( a , b : c , d ) , ( a , d , c : x :d , e , f ) ,(a1 , a2 , a3 , … ak : x :b 1 , b 2 , b3 , … bk )
 In denoting varied doubes (in the form
2 2 2 2 2 2 2 2 2
a + a2 + a3 +…+a k ∧b1 +b 2 +b 3 , … b k =x ¿ , we defined
1

a 1 , a2 , a3 , … ak :b 1 , b2 , b3 , … bk

In denoting simultaneous-varied doubles (in the form

2 2 2 2 2 2 2 2 2 2
a + a2 + a3 +…+a k =x ∧b1 +b +b 3 , … b k =x ¿, we define
1 2

a 1 , a2 , a3 , … ak : x : b1 ,b 2 , b 3 , … b k