Professional Documents
Culture Documents
Introduction
1
In this study, we shall generate Primitive Pythagorean quadruple.
Pythagorean quadruples are integer solutions to a 2+ b2+ c 2=d 2. Like the Primitive
Pythagorean Triple, Primitive Pythagorean Quadruple has the same property that
a, b, c and d are coprimes (no common factor except 1).
Pythagorean Quadruple can be generated by any three numbers using the
formula
a=2 uv , b=2 wv , c=( u + w −v ) , d=( u +w + v )
2 2 2 2 2 2
2
INPUT PROCESS OUTPUT
Basic Concepts in
College Algebra, Proving the Formula in
Geometry and theorem about Finding the
Number Theory
Fibonacci primitive
Fibonacci
Numbers Pythagorean
Numbers
Generation of Quadruple
Recurrence
Pythagorean Proven
relation
Quadruple Primitive
Pythagorea using Pythagorean
n Fibonacci Quadruple
Quadruple Numbers properties and
Primitive Generating number
Pythagorea formula for patterns
n finding the
Quadruple Primitive
Pythagorean
Quadruple
3
The researchers aimed to generate or obtain Primitive Pythagorean
Quadruple using consecutive Fibonacci numbers. This will also sought to answer
the following problem:
1. Solve the recurrence relation using consecutive Fibonacci sequence.
2. Is there a pattern that connects PPQ and Fibonacci numbers?
3. What are possible common divisors in generating PPQ?
4. How many even numbers and odd number do the Primitive Pythagorean
Quadruple have?
The researchers believe that the findings of this study would be beneficial
to the following:
A. Students or Learners
Not all college students are familiar with Fibonacci numbers or
Pythagorean Quadruples especially the primitive ones. This could give them
additional information about this topic when they encounter it in their College
algebra and Number Theory subjects.
B. Faculty
This could provide them some sources, information or example when
teaching related topics to this study.
C. Future Researchers
This study might make some researchers interested and encouraged to
study further about this topic to search for some more patterns that the
researchers of today were not able to dig through. Future researchers might
4
make this research their stepping stone to discover more primitive Pythagorean
quadruples using more Fibonacci numbers.
Definition of Terms
This are the terms that will be mostly used in the discussion of the
research.
5
Greatest Common Divisor - The greatest common divisor, sometimes also
the equation
satisfy the equation but they have no common factor except one
(1) and itself.
6
Chapter 2
This chapter presents the related literatures and studies after the thorough
and in – depth search done by the researchers. The researchers found the
following studies and literature as relevant to the study being proposed.
Related Literature
7
Foreign Studies
Local Studies
8
Relevance of Related Literature and Studies to the Present Study
9
Chapter 3
Methods and Procedures
These chapter deals with the methods used in the study, the sources of
data, data gathering procedures and the basic related concepts. The
comprehensive discussion on how the data and supporting details was obtained,
gathered and presented.
10
One of the resources found by the researchers is the use of the internet. It
stores different information to choose from. It just depend on the researchers to
choose what is reliable or not.
Another source of data and information are books. The researchers went
to the National Library to look for books related to the study. Some of the
information not found on the internet can be basically found on books.
The researchers also used to find information on the theses made by local
researchers. These source of data and information give way for the researchers
to have knowledge on how to do and write a research study.
Pythagorean Quadruple .
From the data gathered from books, theses and internet, the researchers
tried to generate own theorem based on existing theorems of Primitive
Pythagorean Triple.
11
The researchers also solve some problems of Primitive Pythagorean
Quadruple not generated from the Fibonacci numbers if they also have the
existence of the same properties as the researchers have found out in the study.
Based on the table that the researchers do, there are also some
interesting number patterns being found. The researchers would also want to find
out if these kind of number pattern exist in all Pythagorean Quadruples and
Primitive Pythagorean Quadruples
12
Chapter 4
Presentation, Analysis and Interpretation of Data
This chapter deals with the presentation, analysis and interpretation of the
data. The purpose of this chapter is to summarize the collected data.
From the statement of the problem in Chapter 1 of this study, the
researchers will now present, analyze and interpret the data gathered and
answer those questions.
The general formula for finding Pythagorean Quadruple using three
consecutive Fibonacci numbers is
a=2 uv
b=2 wv
c=¿ u2 + vw2−v 2
d=¿ u2 +w 2+ v 2 ;u> v
where a, b, c and d are all positive numbers and u, v, and w are three
consecutive Fibonacci numbers.
Derivation: a 2+ b2=c 2
We shall substitute a 2+ b2=c 2 to the values of a, b, and c above, we have
13
( 2 uv )2 + ( 2 wv )2+ ( u2 +w 2−v 2 ) ²
Squaring them we have:
4 u2 v 2+ 4 w2 v 2 +u4 +2 u2 w2 −2u2 v 2 −2 w2 v 2 u 4 +2 u2 w2
2
d =¿
Squaring them:
2 4 2 2 2 2 2 2 4 4
d =u + 2 u w +2 w v +2 u v +w + v
Now,
d 2 = a 2+ b2 + c2
4 2 2 2 2 2 2 4 4 2 2 2 2 2 2 4 4 4
u +2 u w +2 w v +2 u w + w + v ¿ 2 u v + 2 w v +2 u w +u + w + v
The researchers proved that using this formula it can easily find the
Pythagorean Quadruple.
The Fibonacci numbers that the researchers used here are the three
consecutive numbers in the sequence. The famous Fibonacci sequence is
formed by beginning with the 1’s. The succeeding terms are obtained by adding
the previous two numbers in the sequence. Illustration 1 shows that the
Fibonacci sequence is a recursion.
14
Illustration 1: F0 = 1
F1 =1
F2 = F0 + F1
F3 = F1 + F2
F4 = F2 + F3
.
.
.
Fn = Fn−2 + Fn−1
Theorem 1:
No two consecutive numbers F n∧F n+1factors d¿ 1 in common.
Proof:
15
Suppose that d >1 divides F n and F n+ 1 Then their difference F n+ 1 – F n =
F n−2, will also divisible by d. From this and the formula F n−F n−1 = F n−2, It
can be concluded that d∨F n−2 . Working backwards, we can show that F n−3,
F n−4 ……, and Finally F 1, are all divisible by d. But F 1=1, which is certainly not
divisible by any d >1. This contradiction invalidates our supposition and therefore
proves the theorem.
Q.E.D.
Example:
Fibonacci numbers 1, 2
2, 3
3, 5
5, 3
8, 13
a=2 uv
b=2 wv
16
2 2 2
c=u + w −v
Example
1. Fibonacci Numbers 2, 1, 2
Applying the formula:
¿4 ¿6
¿4 ¿6 ¿ 4 +9 – 1 ¿ 4 +9+1
¿ 12 ¿ 14
2 2 2 2
:̌ a + b +c =d
2 2 2 2
4 +6 +12 =14
17
16+36+ 14=196
196=196
From the table above, the Pythagorean Quadruples generated from three
consecutive Fibonacci Numbers are all even and all is divisible by 2 and have a
greatest common divisor of 2.
Theorem 2:
18
The GCD (a, b, c, and d) is always equal to two when u, v and w are
consecutive Fibonacci numbers.
Proof:
The greatest common divisor of 2uv and 2wv
¿( 2 v)gcd (u , w)
¿( 2 v) gcd ¿
¿ ( 2 v ) gcd ( u , v )
¿ 2 v ×1
¿2v
2 2 2
Gcd ( 2 uv , 2 wv ) ,∧u +w + v
Gcd( 2 v ,u2 + w2 +v 2 )
¿ gcd ¿
19
¿ gcd ¿
¿ gcd (2 v ,2 u2 +2 uv+ 2 v 2)
2 2
¿(2)gcd ( v ,u +uv + v )
¿(2) gcd (v ,u 2+ v 2)
2
¿( 2)gcd (v ,u )
¿( 2)gcd (v ,u)
¿ ( 2) 1
¿2
Q. E. D.
20
2 2 2 2 2 2
2uv 2 wv u + w −v u +w +v
a= b= c= d=
2 2 2 2
u2 +w 2−v 2 u 2+ w 2 + v 2
a=uv b=wv c= d=
2 2
Example: 1, 1, 2
Substitute the given Fibonacci to the formula
2 2 2 2 2 2
(1) +(2) −(1) (1) +(2) +(1)
a=(1)(1)b=(2)(1) c= d=
2 2
1+ 4 – 1 1+4 +1
¿ 1=2= =
2 2
4 6
¿ =
2 2
¿ 2=3
Substituting:
12 +22+ 22=32
1+4 +4=9
21
a b c d
0 0 1 1
1 2 2 3
2 3 6 7
6 10 15 19
15 24 40 49
40 65 104 129
104 168 273 337
273 442 714 883
714 1155 1870 2311
1870 3026 4895 6051
4895 7920 12816 15841
12816 20737 33552 41473
33552 54288 87841 108577
87841 142130 229970 284259
229970 372099 602070 744199
602070 974170 1576239 1948339
1576239 2550408 4126648 5100817
4126648 6677057 10803704 13354113
10803704 17480760 28284465 34961521
28284465 45765226 74049690 91530451
9=9
22
Table 2: List of Primitive Pythagorean Quadruple using Fibonacci Numbers
The researchers have found out some interesting number patterns in the
Pythagorean Quadruples and Primitive Pythagorean Quadruples. As you
observe the table in Figure 3 in the appendix, there are number patterns among
last digits of the values of d and d/2.
2 1
23
4 7
6 3
8 9
The last digits of PQ’s are even and the last digits of PPQ’s are odd.
The researchers also found out that those number patterns repeats as it
hits a certain number when summed up. In a Fibonacci sequence, this kind of
repetition of digits of the numbers are called periods. Periods come from Pisano,
another name directed to Fibonacci itself. Here, at the interval of 10, the last
digits goes back to the first number in the interval when summed up, the total is
50. See Table 4 in the appendix.
There are some interesting properties of Primitive Pythagorean
Quadruple. The researchers based their proposed theorems on the existing
theorem on the properties of Primitive Pythagorean Triples. Refer to Table 3 in
the appendix.
Theorem 3:
A Pythagorean Quadruple is said to be Primitive if the number (a, b, c and
d) have no common divisor d¿ 1. No two of the numbers can have a common
divisors greater than 1.
Proof:
By the Fundamental Theorem of Arithmetic, there must exist some prime
p with p|d since d|a, d|b, d|c. We should then have p|a, p|b, p|c which in turn
24
imply p∨a2, p∨b2, and p∨c2 . But then p|(a 2+ b2+ c 2 ¿ or p∨d 2. An appeal to Euclid’s
lemma now gives p|d. The implication of all this is that p is a common divisor of
the four integers a, b, c, and d, a contradiction that (a, b, c and d) is a Primitive
Pythagorean Quadruple. But this contradiction are use out of the assumption that
d >1, we must conclude that d=1, in the same way, we can verify that
gcd (a , b , c , d)=1
Q.E.D.
Theorem 4:
If (a, b, c and d) is a Primitive Pythagorean Quadruple using Fibonacci
numbers, then two of the integers in (a, b, and c) are even and the other is odd.
The resulting d is also odd.
Proof:
By the result of the theorem above, integers (a, b, and c) cannot be two
odd and one even, so that all we need to show is that they cannot be all even. As
is well-known, even integers can be put in the form 2n, where n is an integer.
Thus, if a, b, and c are even, there exist appropriate choices for h, k, and l for
which,
Then,
d 2=a2 +b2 +c 2
= 4 h2 +4 k 2 +4 l 2
25
= 4 ¿ ¿)
¿4 m
Q.E.D
Example:
Primitive Pythagorean Quadruples (1, 2, 2, 3)
From the theorem above d 2=4 m+1, because it is odd
2 2 2 2
d =a +b +c
= 12 +22+ 22
¿ 1+4 +4
√ d 2= √ 9
d=3
Note: This also applies on any non-Fibonacci numbers. Therefore, all Primitive
Pythagorean Quadruple consist of two even numbers and two odd numbers.
26
Chapter 5
Summary, Conclusions and Recommendations
This chapter presents the summary of the research work undertaken, the
conclusions drawn and the recommendations made as an outgrowth of this
study. This study is on the generation of Primitive Pythagorean Quadruple using
consecutive Fibonacci numbers.
27
Summary
Pythagorean Quadruple .
Based on the data presented and analysed by the researchers, those data
answered the questions found on the statement of the problem in chapter 1 of
this research.
In solving a recurrence relation of a Fibonacci sequence, the preceding
two terms must be added first to find the next Fibonacci number. This numbers
are then used to generate Pythagorean Quadruple. As a result of this, the
28
researchers were able to hypothesize that there is a connection between
Fibonacci numbers and Pythagorean Quadruple.
As a result of findings shown in chapter 4, there is only one common
divisor in Pythagorean Quadruples generated by Fibonacci numbers. That
common divisor is 2. The researchers used that common divisor to generate a
new formula out of the existing formula to generate the Primitive Pythagorean
Quadruple.
As the researchers finished calculating and tabulating the results, it was
found out that the Primitive Pythagorean Quadruples are composed of two (2)
even numbers and two (2) odd numbers.
Also the researchers found out that there are some number patterns in the
Pythagorean Quadruple part and Primitive Pythagorean Quadruple part. Also
some related properties were found.
Conclusion
29
There is also a number pattern found in both Pythagorean and Primitive
Pythagorean Quadruples. At the interval of 10 numbers called periods, the last
digit repeats itself.
Another is the last digit of the Pythagorean Quadruple. It is an even
number and its counterpart last digit in Primitive Pythagorean Quadruple is an
odd number. So, if you know the last digit of the PQ’s you will easily tell the last
digit of the Primitive Pythagorean Quadruple without calculating or computing for
it.
Recommendation
Bibliography
30
Burton, David M. History of Mathematics, An Introduction, Seventh Edition
Chapter 6, p.294.
Carina, Raquel et.al. “On Pythagorean Triples”, Mariano Marcos State
University, Graduate School, Laoag City, Master of Arts in Mathematics, May
2008.
Geraldino, Marietta T. “Pythagorean Triples from Fibonacci Numbers”,
Master’s Thesis, University of San Carlos, Cebu City,2000.
Gimmie, Gilbert et.al. Modern Algebra, Fourth Edition, pp. 63 – 64.
Halai, Chandalas. +plus magazine, “Triples and Quadruples: From
Pythagoras to Fermat (2012).
Johnsonbaugh, Richard. Discrete Mathematics, Fifth Edition p.136
Nuñez, Frances Gochoco Medado. “Fibonacci – type Sequence and
Pythagorean Quadruple, Master’s Thesis, University of San Carlos, Cebu
City, 2003.
Olivrio, Paul. “Self – generating Pythagorean Quadruples and N – Tuples
Appendix
Tables Used in the Research Findings
31
Fibonacci Numbers Pythagorean Quadruple
v u w a b c d
0 1 1 0 0 2 2
1 1 2 2 4 4 6
1 2 3 4 6 12 14
2 3 5 12 20 30 38
3 5 8 30 48 80 98
5 8 13 80 130 208 258
8 13 21 208 336 546 674
13 21 34 546 884 1428 1766
21 34 55 1428 2310 3740 4622
34 55 89 3740 6052 9790 12102
55 89 144 9790 15840 25632 31682
89 144 233 25632 41474 67104 82946
144 233 377 67104 108576 175682 217154
233 377 610 175682 284260 459940 568518
377 610 987 459940 744198 1204140 1488398
610 987 1597 1204140 1948340 3152478 3896678
987 1597 2584 3152478 5100816 8253296 10201634
159
7 2584 4181 8253296 13354114 21607408 26708226
258 2160740
4 4181 6765 8 34961520 56568930 69923042
418 5656893
1 6765 10946 0 91530452 148099380 183060902
32
Primitive Pythagorean Quadruples
a b c d
0 0 1 1
1 2 2 3
2 3 6 7
6 10 15 19
15 24 40 49
40 65 104 129
104 168 273 337
273 442 714 883
714 1155 1870 2311
1870 3026 4895 6051
4895 7920 12816 15841
12816 20737 33552 41473
33552 54288 87841 108577
87841 142130 229970 284259
229970 372099 602070 744199
602070 974170 1576239 1948339
1576239 2550408 4126648 5100817
4126648 6677057 10803704 13354113
10803704 17480760 28284465 34961521
28284465 45765226 74049690 91530451
Table 1: Pythagorean Quadruple using Fibonacci Numbers
33
Table 2: Other sets of Primitive Pythagorean Quadruples
34
Table 3: Theorem 3 and 4 Properties of Primitive Pythagorean Quadruple
d (PQ’s) d(PPQ’s)
1
2
3
6
7
14
19
38
49
98
129
258
337
674
883
1766
2311
4622
6051
12102
15841
31682
41473
82946
108577
217154
284259
568518
744199
1488398
1948339
3896678
5100817
10201634
13354113 35
26708226
34961521
69923042
91530451
183060902
Table 4: Number Patterns Seen on Pythagorean Quadruple and Primitive
Pythagorean Quadruple
36