Surigao State College of Technology

Surigao City

ON POLYNOMIAL SOLUTIONS OF QUADRATIC DIOPHANTINE EQUATIONS

A Thesis presented to

The Faculty of College of Arts and Sciences

SURIGAO STATE COLLEGE OF TECHNOLOGY

Surigao City

In Partial Fulfillment of the Requirements

For the Degree of

BACHELOR OF SCIENCE IN MATHEMATICS

CRISTIN E. MENDOZA

May 2019
 Surigao State College of Technology
APPROVAL SHEET
Surigao City

APPROVAL SHEET

On the Linear Diophantine Equation 𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

CINDY S. BONONO

In partial fulfillment of the requirements for the degree

of Bachelor of Science in Mathematics, this thesis has been

reviewed and is recommended for approval in Oral Examination.

LOUIDA P. PATAC, PhD

Adviser

APPROVED by the Committee for Oral Examination with a grade

of PASSED.

IRMALYN B. PAYMALAN, MS

Chair

CLAIRE ANGELIE G. OSORIO, MA ELVIS P. PATULIN, PhD, EdD

Member Member

ACCEPTED in partial fulfillment of the requirements for the

degree of Bachelor of Science in Mathematics this March, 2019.

ELVIS P. PATULIN, PhD, EdD

 Surigao State College of Technology
Dean, College of Arts
Surigao City and Sciences

ii

A C K N O W L E D G E M E N T

First and foremost, praises and thanks to the God,

the Almighty, for this showers of blessings throughout my

research work to complete the research successfully.

This dissertation would not have been possible without the

guidance and the help of several individuals who in one way or

another contributed and extended their valuable assistance in

the preparation and completion of this study.

To my adviser, Dr. Louida P. Patac, for his untiring

support and benevolence in sharing out the best of his expertise

in research for me as well as for his patience in guiding me

through my study;

To Mrs. Claire Osorio, Mrs. Irmalyn Paymalan, and Dr.

Elvis Patulin, the panel members, for their valuable Comments

and Suggestions, thus, help much to the betterment of my study;

Especially to my beloved Parents, Mr. and Mrs. Sody N.

Bonono and my Siblings, for their financial assistance,

motivation and being my inspiration. Their presence is reason I

have completed this study.

 Surigao State College of Technology
Surigao City

iii

ABSTRACT

In this paper, the linear Diophantine equation only in the

form of 𝑚𝑛2𝑥 + 𝑞𝑚2𝑦 = 𝑝𝑚2𝑛3 has a positive integer solution (𝑥, 𝑦)

under some conditions where 𝑚, 𝑛, 𝑝 and 𝑞 are prime numbers less

than or equal 7. The concept of Euclid’s Algorithm in deriving

solutions from the given equations was applied.

 Surigao State College of Technology
Surigao City

iv

TABLE OF CONTENTS

Title Page

APPROVAL SHEET

ACKNOWLEDGEMENT ii

ABSTRACT iii

TABLE OF CONTENTS iv

LIST OF NOTATIONS v

CHAPTER

1 BACKGROUND OF THE STUDY 1

Introduction 1

Basic Concepts 2

2 PRELIMINARY RESULT 7

3 MAIN RESULTS 12

4 SUMMARY OF RESULTS 25

REFERENCES 26

APPENDIX 27

CURRICULUM VITAE 31
 Surigao State College of Technology
Surigao City

LIST OF NOTATIONS

ℤ+ Set of non-negative integers

𝑑 𝑔𝑐𝑑(𝑎, 𝑏)

(𝑥, 𝑦) Positive integer solution

 Surigao State College of Technology
Surigao City

Chapter 1

BACKGROUND OF THE STUDY

This chapter presents the introduction, objectives, and basic

concepts of the study.

Introduction

Finding solutions of equations in integers is one of the

oldest mathematical problems. As early as the beginning of the

second millennium B.C. ancient Babylonians succeeded in solving

systems of equations in two unknowns.

In Mathematics, Diophantine equations are central objects

in number theory as they express natural questions such as the

ways to write a number as a sum of cubes, but naturally come up

in all questions that can be reduced to questions involving

discrete objects, e.g. in algebraic topology.

Moreover, Diophantine equations can be reduced modulo

primes, and then occur in coding theory and cryptography. For

instance, elliptic curve cryptography is based on doing

calculations in finite field.

 Surigao State College of Technology
Surigao City

Sierpinski derived that the Diophantine equation 3𝑥 + 4𝑦 = 52

has only positive integer solution (𝑥, 𝑦, 𝑧) = (2,2,2). Brown studied

the Diophantine equation 𝑎𝑥 2 + 𝐷𝑏 2 = 𝑦 𝑛 which has the only

positive integer solution (𝑥 , 𝑦 , 𝑚 , 𝑛) = (10 ,7, 5, 3) with gcd(𝑥, 𝑦) = 1,

𝑚 is odd and 𝑛 ≥ 3. Hadano studied Diophantine equation 𝑎 𝑥 = 𝑏 𝑦 +

𝑐 𝑧.

In this paper, we consider the linear Diophantine equation

𝑚𝑛2 𝑦 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3 where 𝑚, 𝑛, 𝑝, 𝑞 are prime numbers less than or

equal to 7 has a positive integer solution (, 𝑥, 𝑦).

Basic Concepts

Definition 1.1

A Linear Diophantine Equation is an equation of the general form

𝑎𝑥 + 𝑏𝑦 = 𝑐, where solutions are sought with integers a, 𝑏 and 𝑐.

Example 1.2

A given linear Diophantine equation can have a number of

solutions, as is the case with 3𝑥 + 6𝑦 = 18, where

 Surigao State College of Technology
Surigao City

3 ∙ 4 + 6 ∙ 1 = 18

3( −6) + 6 ∙ 6 = 18

3 ∙ 10 + 6( −2) = 18

Definition 1.3

Two integers 𝑎 and 𝑏, not both of which are zero, are said to be

relatively prime whenever 𝑔𝑐𝑑(𝑎, 𝑏) = 1.

Example 1.4

12 and 35 are relatively prime since 𝑔𝑐𝑑(12,35) = 1

Definition 1.5 An integer 𝑏 is said to be divisible by an

integer 𝑎 ≠ 0, in symbols 𝑎|𝑏, if there exist some integer 𝑐 such

that 𝑏 = 𝑎𝑐.

Example 1.6

If 𝑎 = 3, 𝑏 = 6, then 3|6 since 6 = 3(2)

Definition 1.7 Given integers 𝑎 and 𝑏, with 𝑏 > 0, there exist

unique integers 𝑞 and 𝑟 satisfying

𝑎 = 𝑏𝑞 + 𝑟 0≤𝑟<𝑏
 Surigao State College of Technology
The integers 𝑞 and 𝑟 are called, respectively, the quotient and
Surigao City

remainder in the division of 𝑎 and 𝑏.

Example 1.8

If 𝑎 = 10 and 𝑏 = 5, then 10 = 5(2) + 0

Definition 1.9 Division Algorithm

Let 𝑎 and 𝑏 be two integers whose greatest common divisor is

desired. Because 𝑔𝑐𝑑(|𝑎|, |𝑏|) = 𝑔𝑐𝑑(𝑎 , 𝑏), there is no harm in

assuming that 𝑎 ≥ 𝑏 > 0. The first step is to apply the Division

Algorithm to 𝑎 and 𝑏 to get

𝑎 = 𝑞1 𝑏 + 𝑟1 0 < 𝑟1 < 𝑏

The division process continues until some none zero remainder

appears. The result is the following system of equation:

𝑎 = 𝑞1 𝑏 + 𝑟1 0 < 𝑟1 < 𝑏

𝑏 = 𝑞2 𝑟1 + 𝑟2 0 < 𝑟2 < 𝑟1

𝑟1 = 𝑞3 𝑟2 + 𝑟3 0 < 𝑟3 < 𝑟2

𝑟𝑛−2 = 𝑞𝑛 𝑟𝑛−1 + 𝑟𝑛 0 < 𝑟𝑛 < 𝑟𝑛−1

𝑟𝑛−1 = 𝑞𝑛+1 𝑟𝑛 + 0 0 < 𝑟𝑛 < 𝑟𝑛−1

 Surigao State College of Technology
The last nonzero remainder Surigao
that appears
City in this manner is equal

to 𝑔𝑐𝑑(𝑎, 𝑏).

Example 1.10 The gcd(12378, 3054) = 6 since

12378 = 4 ∙ 3054 + 162

3054 = 18 ∙ 162 + 138

162 = 1 ∙ 138 + 24

138 = 5 ∙ 24 + 18

24 = 1 ∙ 18 + 6

18 = 3 ∙ 6 + 0

Theorem 1.11

Given integers 𝑎 and 𝑏, not both of which are zero, there exist

integers 𝑥 and 𝑦 such that 𝑔𝑐𝑑(𝑎, 𝑏) = 𝑎𝑥 + 𝑏𝑦.

Theorem 1.12

Let 𝑎 and 𝑏 be integers, not both zero. Let 𝑑 = 𝑔𝑐𝑑(𝑎, 𝑏) and let 𝑆 =

{𝑐 ∈ ℤ| 𝑡ℎ𝑒𝑟𝑒 𝑒𝑥𝑖𝑠𝑡 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 𝑥 𝑎𝑛𝑑 𝑦 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑐 = 𝑥𝑎 + 𝑦𝑏}. Then 𝑑 is the

smallest positive integer in 𝑆.

Theorem 1.13

For integers 𝑎, 𝑏 and 𝑐, the following hold:

 Surigao State College of Technology
a. 𝑎|1 if and only if 𝑎 = ±1 Surigao City

b. If 𝑎|𝑏 and 𝑎|𝑐, then 𝑎|(𝑏𝑥 + 𝑐𝑦) for arbitrary integers 𝑥 and 𝑦

Theorem 1.14

For all integers 𝑎 and 𝑏, not both zero, if 𝑑 = gcd(𝑎, 𝑏), then

there exist integers 𝑠 and 𝑡 such that 𝑎𝑠 + 𝑏𝑡 = 𝑑.

Lemma 1.15 Euclid's lemma

If 𝑎|𝑏𝑐 with gcd(𝑎, 𝑏) = 1, then 𝑎|𝑐.

 Surigao State College of Technology
Surigao City

Chapter 2

PRELIMINARY RESULTS

This chapter presents the preliminary results after having

been considered the information cited in Chapter 1.

The equation in one or more unknown which is to be solved in the

integers is called the Diophantine equation. In this paper, we

will consider the linear Diophantine equation in two unknown;

𝑎𝑥 + 𝑏𝑦 = 𝑐, (1)

Where 𝑎, 𝑏, 𝑐 are given integers and a, 𝑏 not both zero. A solution

of this equation is a pair of integers 𝑥0 , 𝑦0 which satisfy 𝑎𝑥0 +

𝑏𝑦0 = 𝑐.

Theorem 2.1

Let 𝑎 and 𝑏 be integers, not both zero. Then 𝑎 and 𝑏 are

relatively prime if and only if there exist integers 𝑥 and 𝑦 such

that 1 = 𝑎𝑥 + 𝑏𝑦.
 Surigao State College of Technology
Proof: Surigao City

Suppose 𝑎 and 𝑏 are relatively prime, then gcd(𝑎, 𝑏) = 1. By

Theorem 1.11, there exist integers 𝑥 and 𝑦 satisfying 1 = 𝑎𝑥 + 𝑏𝑦.

Conversely, we let that 1 = 𝑎𝑥 + 𝑏𝑦 for some 𝑥 and 𝑦, and that 𝑑 =

gcd(𝑎, 𝑏). Since 𝑑|𝑎 and 𝑑|𝑏, applying (b) of Theorem 1.13,

𝑑|(𝑎𝑥 + 𝑏𝑦) or 𝑑|1. In as much as 𝑑 is a positive integer, this

divisibility condition (part (a) of Theorem 1.13) forces 𝑑 to

equal 1. Then the desired conclusion follows.∎

Theorem 2.2

i. The linear Diophantine equation 𝑎𝑥 + 𝑏𝑦 = 𝑐 has a solution

if and only if 𝑑|𝑐, where 𝑑 = 𝑔𝑐𝑑(𝑎, 𝑏).

ii. If 𝑥0 , 𝑦0 is any particular solution of this equation, then

𝑏 𝑎
all other solution are given by 𝑥 = 𝑥0 + 𝑡 𝑑 and 𝑥 = 𝑥0 − 𝑡 𝑑 for

varying integer.

Proof:

i. Let 𝑑 = gcd(𝑎, 𝑏) and suppose 𝑑|𝑐. Since 𝑑 divides 𝑐, there

exist an integer 𝑘 so that 𝑐 = 𝑑𝑘, and by Theorem 1.14,

there exist integers 𝑟 and 𝑠 such that 𝑎𝑟 + 𝑏𝑠 = 𝑑. Now,

 Surigao State College of Technology
𝑎𝑟 + 𝑏𝑠City
Surigao =𝑑

𝑘(𝑎𝑟 + 𝑏𝑠) = (𝑑)𝑘

𝑎𝑟𝑘 + 𝑏𝑠𝑘 = 𝑑𝑘 = 𝑐

Since the products of integers are integers, 𝑥 = 𝑟𝑘 and 𝑦 = 𝑠𝑘 is

a solution in integers for 𝑎𝑥 + 𝑏𝑦 = 𝑐. Conversely, suppose 𝑎𝑥 +

𝑏𝑦 = 𝑐 has at least one solution in integers (𝑥0 , 𝑦0 ). Then

𝑎𝑥0 + 𝑏𝑦0 = 𝑐.

Let 𝑑 = gcd(𝑎, 𝑏). By Definition 1.5, there exist integers 𝑟 and 𝑠

so that 𝑎 = 𝑑𝑟 and 𝑏 = 𝑑𝑠. Then,

𝑐 = 𝑎𝑥0 + 𝑏𝑦0

𝑐 = 𝑑𝑟𝑥0 + 𝑑𝑠𝑦0 = 𝑑(𝑟𝑥0 + 𝑠𝑦0 )

But 𝑟𝑥0 + 𝑠𝑦0 is an integer because it is a sum of products of

integers, and so 𝑑 divides 𝑐 by Definition 1.5.∎

Proof:

ii. Suppose that a solution (𝑥0 , 𝑦0 ) of the equation is known. If

𝑥 ′ , 𝑦′ is any other solution, then

𝑎𝑥0 + 𝑏𝑦0 = 𝑐 = 𝑎𝑥 ′ + 𝑏𝑦′

Which is equivalent to
 Surigao State College of Technology
𝑎(𝑥 ′ Surigao
− 𝑥0 ) =City
𝑏(𝑦0 − 𝑦′)

To show,

𝑎𝑥 ′ + 𝑏𝑦 ′ = 𝑎𝑥0 + 𝑏𝑦0

𝑎𝑥 ′ − 𝑎𝑥0 + 𝑏𝑦 ′ = 𝑎𝑥0 − 𝑎𝑥0 + 𝑏𝑦0

10

𝑎𝑥 ′ − 𝑎𝑥0 + 𝑏𝑦 ′ = 𝑏𝑦0

𝑎𝑥 ′ − 𝑎𝑥0 + 𝑏𝑦 ′ − 𝑏𝑦 ′ = 𝑏𝑦0 − 𝑏𝑦′

𝑎𝑥 ′ − 𝑎𝑥0 = 𝑏𝑦0 − 𝑏𝑦′

𝑎(𝑥 ′ − 𝑥0 ) = 𝑏(𝑦0 − 𝑦′)

Let 𝑑 = 𝑔𝑐𝑑(𝑎, 𝑏). Then 𝑑 ≥ 1 and there exist nonzero integers 𝑟 and

𝑠 so that 𝑎 = 𝑑𝑟 and 𝑏 = 𝑑𝑠. Now,

𝑎(𝑥 ′ − 𝑥0 ) = 𝑏(𝑦0 − 𝑦′)

(𝑥 ′ − 𝑥0 ) (𝑦0 − 𝑦′)
𝑑𝑟 = 𝑑𝑠
𝑑 𝑑

𝑟(𝑥 ′ − 𝑥0 ) = 𝑠(𝑦0 − 𝑦′)

By Definition 1.5, 𝑟|𝑠(𝑦0 − 𝑦 ′ ) with gcd(𝑟, 𝑠) = 1. Using Euclid’s

lemma, it must be the case that 𝑟|(𝑦0 − 𝑦′) or in other words, 𝑦0 −

𝑦 ′ = 𝑟𝑡 for some integer 𝑡. Substituting, we obtain 𝑥 ′ − 𝑥0 = 𝑠𝑡

 Surigao State College of Technology
This leads to the formulas Surigao City

𝑏
𝑥 ′ = 𝑥0 + 𝑠𝑡 = 𝑥0 + (𝑑) 𝑡

𝑎
𝑦 ′ = 𝑦0 − 𝑟𝑡 = 𝑦0 − (𝑑) 𝑡

It is easy to see that these values satisfy the Diophantine

equation, regardless of the choice for the integer 𝑡. For

11

𝑏 𝑎
𝑎𝑥 ′ + 𝑏𝑦 ′ = 𝑎 [𝑥0 + ( ) 𝑡] + 𝑏 [𝑦0 − ( ) 𝑡]
𝑑 𝑑
𝑎𝑏 𝑎𝑏
= 𝑎𝑥0 + ( 𝑑 ) 𝑡 + 𝑏𝑦0 − ( 𝑑 ) 𝑡

𝑎𝑏 𝑎𝑏
= (𝑎𝑥0 + 𝑏𝑦0 ) + (( 𝑑 ) 𝑡 − ( 𝑑 ) 𝑡)

𝑎𝑏 𝑎𝑏
= (𝑎𝑥0 + 𝑏𝑦0 ) + ( 𝑑 − )𝑡
𝑑

= 𝑐 + 𝑜(𝑡), where 𝑐 = 𝑎𝑥0 + 𝑏𝑦0

=𝑐

Hence, there are infinite numbers of solution of the given

equation, one for each value of 𝑡.∎

 Surigao State College of Technology
Surigao City

12

Chapter 3

MAIN RESULTS

This chapter showcases the main result of the study.

Theorem 3.1

The linear Diophantine equation 𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3 has the

positive solutions under some conditions where 𝑚, 𝑛, 𝑝, 𝑞 are prime

numbers.

Proof:

Let 𝑎, 𝑏, 𝑐 ∈ ℤ such that a= 𝑚𝑛2 , 𝑏 = 𝑞𝑚2 and c= 𝑝𝑚2 𝑛3 where 𝑚, 𝑛, 𝑝, 𝑞

are prime numbers into 𝑎𝑥 + 𝑏𝑦 = 𝑐. Now,

𝑎𝑥 + 𝑏𝑦 = 𝑐 (1)
 Surigao State College of Technology
𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = Surigao
𝑝𝑚2 𝑛3 City (2)

By Euclid’s Algorithm to the evaluation of 𝑔𝑐𝑑(𝑚𝑛2 , 𝑞𝑚2 ), we find

that

𝑞𝑚2 = 1 ∙ 𝑚𝑛2 + (𝑞𝑚 − 𝑛2 )𝑚

𝑛2
𝑚𝑛2 = ((𝑞𝑚−𝑛2 )) ∙ ((𝑞𝑚 − 𝑛2 )𝑚) + 0

13

Thus, 𝑔𝑐𝑑(𝑚𝑛2 , 𝑞𝑚2 ) = (𝑞𝑚 − 𝑛2 )𝑚. Since (𝑞𝑚 − 𝑛2 )𝑚|𝑝𝑚2 𝑛3, a solution

to this equation exists. To obtain the integer (𝑞𝑚 − 𝑛2 )𝑚, we

have

(𝑞𝑚 − 𝑛2 )𝑚 = 𝑞𝑚2 − 𝑚𝑛2

𝑝𝑚𝑛3 𝑝𝑚𝑛3
((𝑞𝑚−𝑛2 )) ((𝑞𝑚 − 𝑛2 )𝑚) = (𝑞𝑚2 − 𝑚𝑛2 ) ((𝑞𝑚−𝑛2 ))

𝑝𝑚𝑛3
𝑝𝑚2 𝑛3 = ∙ 𝑞𝑚2 − 𝑚𝑛2
𝑞𝑚−𝑛2

(𝑝𝑚𝑛3 )(𝑞𝑚2 −𝑚𝑛2 )

=
𝑞𝑚−𝑛2

𝑝𝑞𝑚3 𝑛3 −𝑝𝑚2 𝑛5
=
𝑞𝑚−𝑛2

𝑝𝑞𝑚3 𝑛3 𝑝𝑚2 𝑛5
=( ) − (𝑞𝑚−𝑛2 )
𝑞𝑚−𝑛2

𝑝𝑚2 𝑛5 𝑝𝑞𝑚3 𝑛3
= (− ) + ( 𝑞𝑚−𝑛2 )
𝑞𝑚−𝑛2

𝑝𝑚𝑛3 𝑝𝑚𝑛3
= 𝑚𝑛2 (− ) + 𝑞𝑚2 (𝑞𝑚−𝑛2 )
𝑞𝑚−𝑛2
 Surigao State College of Technology
So that Surigao City

𝑝𝑚𝑛3 𝑝𝑚𝑛3
𝑥 = − (𝑞𝑚−𝑛2 ) and 𝑦 = (𝑞𝑚−𝑛2 )

Provide one solution to the Diophantine equation. By Theorem

2.2, all other solution are expressed by

14

𝑝𝑚𝑛3 𝑞𝑚2 𝑝𝑚𝑛3 𝑞𝑚

𝑥 = − (𝑞𝑚−𝑛2 ) + (𝑞𝑚−𝑛2 )𝑚𝑡 = − (𝑞𝑚−𝑛2 ) + (𝑞𝑚−𝑛2 ) 𝑡 (6)

𝑝𝑚𝑛3 𝑚𝑛2 𝑝𝑚𝑛3 𝑛2

𝑦 = (𝑞𝑚−𝑛2 ) − (𝑞𝑚−𝑛2 )𝑚𝑡 = (𝑞𝑚−𝑛2 ) − (𝑞𝑚−𝑛2 ) 𝑡 (7)

For some integer 𝑡. A further work provides the solution in the

positive integers. For this, 𝑡 must be chosen so as to satisfy

simultaneously the inequalities.

If 𝑥 > 0, then

𝑝𝑚𝑛3 𝑞𝑚 𝑝𝑛3
𝑥 = − (𝑞𝑚−𝑛2 ) + (𝑞𝑚−𝑛2 ) 𝑡 > 0 and 𝑡 > 𝑞

If 𝑦 > 0, then
 Surigao State College of Technology
𝑝𝑚𝑛3 𝑛2
𝑦= (𝑞𝑚−𝑛2 )
− (𝑞𝑚−𝑛2 ) 𝑡 >Surigao
0 andCity
𝑡 < 𝑝𝑚𝑛

Since 𝑡 must be an integer, we are impelled to conclude that

𝑝𝑛3
< 𝑡 < 𝑝𝑚𝑛. Hence, our Diophantine equation has a positive
𝑞

solution 𝑥 and 𝑦 corresponding the value of integer 𝑡.

15

From the results obtained solutions 𝑥 and 𝑦 vary as there are

many possible values of prime numbers 𝑚, 𝑛, 𝑝, 𝑞. In this paper, we

consider only 4 cases and all the prime numbers less than or

equal to 7.

Case 1: For 𝑚 = 𝑛 = 𝑝 = 𝑞 = 2

The equation 𝑎𝑥 + 𝑏𝑦 = 𝑐 becomes

𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

(2)(22 )𝑥 + (2)(22 )𝑦 = (2)(22 )(23 )

8𝑥 + 8𝑦 = 64

Since 𝑔𝑐𝑑(8,8) = 8 and 8|64, then there are infinitely many

solutions. Now,

𝑝𝑚𝑛3 (2)(2)(23 ) 32 32
𝑥 = − (𝑞𝑚−𝑛2 ) = − ((2)(2)−22 ) = − 4−4 = − 0
 Surigao State College of Technology
𝑝𝑚𝑛3 (2)(2)(23 ) Surigao
32 32
𝑦= (𝑞𝑚−𝑛2 )
= ((2)(2)−22 )
= = City
4−4 0

32
However, ± is undefined and thus, not an element of integers.
0

Therefore, there is no solution for equation 𝑎𝑥 + 𝑏𝑦 = 𝑐 for 𝑚 =

𝑛 = 𝑝 = 𝑞 = 2. Similarly, for 2 < 𝑚 ≤ 7.

16

Case 2: For consecutive prime numbers 𝑚 < 𝑛 < 𝑝 < 𝑞.

 𝑚 = 2, 𝑛 = 3, 𝑝 = 5, 𝑞 = 7

The equation 𝑎𝑥 + 𝑏𝑦 = 𝑐 becomes

𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

(2)(32 )𝑥 + (7)(22 )𝑦 = (5)(22 )(33 )

18𝑥 + 28𝑦 = 540

Since 𝑔𝑐𝑑(18,28) = 2 and 2|540, there are infinitely many solutions

of the equation 𝑎𝑥 + 𝑏𝑦 = 𝑐 . We have

𝑝𝑚𝑛3 (5)(2)(33 ) 270 270

𝑥 = − (𝑞𝑚−𝑛2 ) = − ((7)(2)−32 ) = − 14−9 = − = −54
5

𝑝𝑚𝑛3 (5)(2)(33 ) 270 270

𝑦 = (𝑞𝑚−𝑛2 ) = ((7)(2)−32 ) = 14−9 = = 54
5

There exist positive integer 𝑡 such that 19 < 𝑡 < 30. Now, using

𝑝𝑚𝑛3 𝑞𝑚 𝑝𝑚𝑛3 𝑛2
the formula 𝑥 = − (𝑞𝑚−𝑛2 ) + (𝑞𝑚−𝑛2 ) 𝑡 and 𝑦 = (𝑞𝑚−𝑛2 ) − (𝑞𝑚−𝑛2 ) 𝑡, we have
 Surigao State College of Technology
𝑡 Surigao
𝑥 City 𝑦

20 2 18

21 4.8 16.2

17

22 7.6 14.4

23 10.4 12.6

24 34.8 10.8

25 16 9

26 18.8 7.2

27 21.6 5.4

28 24.4 3.6

29 27.2 1.8

Therefore, the Diophantine equation a𝑥 + 𝑏𝑦 = 𝑐 has a positive

integer solutions when 𝑡 = 20 and 𝑡 = 25.

Case 3: For 𝑚 > 𝑛 > 𝑝 > 𝑞

 Surigao State College of Technology
 𝑚 = 7, 𝑛 = 5, 𝑝 = 3, 𝑞 = 2 Surigao City

The Diophantine equation 𝑎𝑥 + 𝑏𝑦 = 𝑐 becomes

𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

(7)(52 )𝑥 + (2)(72 )𝑦 = (3)(72 )(53 )

175𝑥 + 98𝑦 = 18375

18

Since 𝑔𝑐𝑑(175, 98) = 7 and 7|18375, then there are infinitely many

solutions. Then,

𝑝𝑚𝑛3 (3)(7)(53 ) 2625 2625

𝑥 = − (𝑞𝑚−𝑛2 ) = − ((2)(7)−52 ) = − 14−25 = − = 238.636
−11

𝑝𝑚𝑛3 (3)(7)(53 ) 2625 2625

𝑦 = (𝑞𝑚−𝑛2 ) = ((2)(7)−52 ) = − 14−25 = − = −238.636
11

But the values we obtain are not an integer. Hence, there is no

solution for the equation 𝑎𝑥 + 𝑏𝑦 = 𝑐.

Case 4: For 𝑚 < 𝑛 < 𝑝 = 𝑞

 𝑚 = 2, 𝑛 = 3, 𝑝 = 𝑞 = 5

The equation 𝑎𝑥 + 𝑏𝑦 = 𝑐 becomes

𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

(2)(32 )𝑥 + (5)(22 )𝑦 = (5)(22 )(33 )

18𝑥 + 20𝑦 = 540

 Surigao State College of Technology
Since 𝑔𝑐𝑑(18,20) = 2 and 2|540, then
Surigao City there are infinitely many

solutions. We have,

𝑝𝑚𝑛3 (5)(2)(33 ) 270 270

𝑥=− 2
= − =− =− = −270
(𝑞𝑚 − 𝑛 ) 2
((5)(2) − 3 ) 10 − 9 1

19

𝑝𝑚𝑛3 (5)(2)(33 ) 270 270

𝑦= = = = = 270
(𝑞𝑚 − 𝑛2 ) ((5)(2) − 32 ) 10 − 9 1

There exist positive integer 𝑡 such that 27 < 𝑡 < 30. By direct

𝑝𝑚𝑛3 𝑞𝑚 𝑝𝑚𝑛3
substitution the equations 𝑥 = − (𝑞𝑚−𝑛2 ) + (𝑞𝑚−𝑛2 ) 𝑡 and 𝑦 = (𝑞𝑚−𝑛2 ) −

𝑛2
(𝑞𝑚−𝑛2 )
𝑡, we get the following results:

𝑡 𝑥 𝑦

28 10 18

29 20 9

Hence, the equation has a positive integer solution when 𝑡 = 28

and 𝑡 = 29.
 Surigao State College of Technology
Surigao City

 𝑚 = 2, 𝑛 = 3, 𝑝 = 𝑞 = 7

The equation a𝑥 + 𝑏𝑦 = 𝑐 becomes

𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

(2)(32 )𝑥 + (7)(22 )𝑦 = (7)(22 )(33 )

20

18𝑥 + 28𝑦 = 756

Since 𝑔𝑐𝑑(18, 28) = 2 and 2|756, then are infinitely many solutions

for the given equation. But,

𝑝𝑚𝑛3 (7)(2)(33 ) 756 756

𝑥=− 2
= − =− =− = −151.2 ∉ ℤ
(𝑞𝑚 − 𝑛 ) 2
((7)(2) − 3 ) 14 − 9 5

𝑝𝑚𝑛3 (7)(2)(33 ) 756 756

𝑦= 2
=− = = = 151.2 ∉ ℤ
(𝑞𝑚 − 𝑛 ) ((7)(2) − 3 ) 14 − 9
2 5

Therefore, there is no positive integer solution for the

equation a𝑥 + 𝑏𝑦 = 𝑐.

 𝑚 = 2, 𝑛 = 5, 𝑝 = 𝑞 = 7

The equation a𝑥 + 𝑏𝑦 = 𝑐 becomes

𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

 Surigao State College of Technology
(2)(52 )𝑥 +Surigao
(7)(22 )𝑦 = (7)(22 )(53 )
City

50𝑥 + 28𝑦 = 3500

Since 𝑔𝑐𝑑(50,28) = 2 and 2|3500, then there are infinitely many

solution for the given equation. However,

21

𝑝𝑚𝑛3 (7)(2)(53 ) 3500 −3500

𝑥=− 2
= − = − = = 318.18 ∉ ℤ
(𝑞𝑚 − 𝑛 ) ((7)(2) − 52 ) 14 − 25 −11

𝑝𝑚𝑛3 (7)(2)(53 ) 3500 3500

𝑦= 2
= = = = −318.18 ∉ ℤ
(𝑞𝑚 − 𝑛 ) ((7)(2) − 5 ) 14 − 25 −11
2

Hence, the Diophantine equation 𝑎𝑥 + 𝑏𝑦 = 𝑐 has no positive

integer solution.

Case 5: For 𝑚 < 𝑛 = 𝑝 < 𝑞

 𝑚 = 2, 𝑛 = 𝑝 = 3, 𝑞 = 5

The equation a𝑥 + 𝑏𝑦 = 𝑐 becomes

𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

(2)(32 )𝑥 + (5)(22 )𝑦 = (3)(22 )(33 )

 Surigao State College of Technology
18𝑥 + 20𝑦City
Surigao = 324

Since 𝑔𝑐𝑑(18,20) = 2 and 2|324, then there are infinitely many

solution for the given equation. We have,

𝑝𝑚𝑛3 (3)(2)(3)3 162 162

𝑥=− 2
=− =− =− = −162
(𝑞𝑚 − 𝑛 ) 2
((5)(2) − 3 ) 10 − 9 1

22

𝑝𝑚𝑛3 (3)(2)(33 ) 162 162

𝑦= = = = = 162
(𝑞𝑚 − 𝑛2 ) ((5)(2) − 52 ) 10 − 9 1

There exist positive integer 𝑡 such that 16 < 𝑡 < 18. So, the

other solutions are

𝑝𝑚𝑛3 𝑞𝑚 (5)(2)
𝑥 = − (𝑞𝑚−𝑛2 ) + (𝑞𝑚−𝑛2 ) 𝑡 = −162 + ((5)(2)−32 ) 17 = −162 + 170 = 8

𝑝𝑚𝑛3 𝑛2 32
𝑦 = (𝑞𝑚−𝑛2 ) − (𝑞𝑚−𝑛2 ) 𝑡 = 162 − ((5)(2)−32 ) 17 = 162 − 153 = 9.

 𝑚 = 3, 𝑛 = 𝑝 = 5, 𝑞 = 7

The equation a𝑥 + 𝑏𝑦 = 𝑐 becomes

𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

(3)(52 )𝑥 + (7)(32 )𝑦 = (5)(22 )(33 )

75𝑥 + 63𝑦 = 540

 Surigao State College of Technology
Since 𝑔𝑐𝑑(75,63) = 2 and 2|540, then
Surigao City there are infinitely many

solution for the given equation. We have,

𝑝𝑚𝑛3 (5)(3)(35 1875 −1875

𝑥=− 2
= − =− = = 468.75
(𝑞𝑚 − 𝑛 ) 2
((7)(3) − 5 ) 21 − 25 −4

𝑝𝑚𝑛3 (5)(3)(35 1875 1875

𝑦= = = = = −468.75
(𝑞𝑚 − 𝑛2 ) ((7)(3) − 52 ) 21 − 25 −4

23

Therefore, there is no positive integer solution for the

equation a𝑥 + 𝑏𝑦 = 𝑐.

Case 6: For 𝑝 < 𝑚 = 𝑛 < 𝑞

 𝑝 = 2, 𝑚 = 𝑛 = 3, 𝑞 = 5

The equation a𝑥 + 𝑏𝑦 = 𝑐 becomes

𝑚𝑛2 𝑥 + 𝑞𝑚2 𝑦 = 𝑝𝑚2 𝑛3

(3)(32 )𝑥 + (5)(32 )𝑦 = (2)(32 )(33 )

27𝑥 + 45𝑦 = 486

Since 𝑔𝑐𝑑(27,45) = 3 and 3|486, then there are infinitely many

solution for the given equation. We have,

 Surigao State College of Technology
𝑝𝑚𝑛3 (2)(3)(3) 3
Surigao City 162 162
𝑥=− = − = − = − = −27
(𝑞𝑚 − 𝑛2 ) ((5)(3) − 32 ) 15 − 9 6

𝑝𝑚𝑛3 (2)(3)(33 ) 162 162

𝑦= 2
= = = =2
(𝑞𝑚 − 𝑛 ) ((5)(3) − 52 ) 15 − 9 6

24

There exist positive integer 𝑡 such that 10 < 𝑡 < 18. By direct

𝑝𝑚𝑛3 𝑞𝑚 𝑝𝑚𝑛3
substitution the equations 𝑥 = − (𝑞𝑚−𝑛2 ) + (𝑞𝑚−𝑛2 ) 𝑡 and 𝑦 = (𝑞𝑚−𝑛2 ) −

𝑛2
(𝑞𝑚−𝑛2 )
𝑡, we get the following results:

𝑡 𝑥 𝑦

11 0.5 43.5

12 3 9

13 5.5 7.5

14 8 6
 Surigao State College of Technology
15 Surigao
10.5City 4.5

16 13 3

17 15.5 1.5

Therefore, the Diophantine equation a𝑥 + 𝑏𝑦 = 𝑐 has a positive

integer solutions when 𝑡 = 12, 𝑡 = 14 and 𝑡 = 16.

25

Chapter 4

SUMMARY OF RESULTS

This chapter gives the summary of results of the study.

The positive integer solution (𝑥, 𝑦) of the diophantine equation

(1) exists if there is a positive integer 𝑡 and it satisfies the

conditions of case 2, that is, for consecutive prime numbers 𝑚 <

𝑛 < 𝑝 < 𝑞, ofcase 4 for the case 𝑚 < 𝑛 < 𝑝 = 𝑞, of case 5 for the

case 𝑚 < 𝑛 = 𝑝 < 𝑞 and of case 6 for 𝑝 < 𝑚 = 𝑛 < 𝑞. The solution of
 Surigao State College of Technology
diophantine equation (1) does notCity
Surigao exist if it falls to the case

1 which is for 𝑚 = 𝑛 = 𝑝 = 𝑞 and case 3 for 𝑚 > 𝑛 > 𝑝 > 𝑞.

26

REFERENCES

[1] E. Brown, Diophantine equations of the form ax2 + Db2 = yn,

J. Reine. Angew. Math., 291(1977), 118-127.

[2] D.M. Burton, Elementary Number of Theory, Wm. C. Brown

Publishers, Iowa, 1989.

[3] W. Sierpi´nski, On the equation 3x +4 y =5 z, Wiadom. Mat.,

1(1955/1956), 194-195.

[4] T. Hadano, On the Diophantine equation ax = by +cz, Math. J.

Okayama University, 19(1976), 1-5.

 Surigao State College of Technology
[5] M.Burton Elementary NumberSurigaoTheory
City Sixth Edition, University

of New Hampshire

27

APPENDIX
Surigao State College of Technology
Surigao City

28
Surigao State College of Technology
Surigao City
Surigao State College of Technology
Surigao City 29
Surigao State College of Technology
Surigao City 30
 Surigao State College of Technology
Surigao City
31

CURRICULUM VITAE

Name: Cindy S. Bonono

Address: Brgy. Buhing Calipay,
San Isidro, Surigao del Norte
Mobile: 09480005587
Email Add: dycin@gmail.com

PERSONAL BACKGROUND

Date of Birth: December 29, 1998

Place of Birth: Siargao Island
Civil Status: Single
Citizenship: Filipino
Religion: Church of Christ
Heigh:t 5’0”
Weight: 40 kg.
Father’s Name: Sody N. Bonono
Mother’s Name: Marites S. Bonono
_______________________________________________________________

SCHOLASTIC DATA

Level School

Primary Buhing Calipay Elem. School

Honorable Mention

Secondary Roxas National High School

Batch Salutatorian

Tertiary Surigao State College of Technology

DOST Scholar

WORK EXPERIENCES

Position Inclusive Date/Year Company Address

 Surigao State College of Technology
OJT Math Teacher 2019Surigao City SSCT

32

TRAININGS/SEMINARS ATTENDED

Title Inclusive Year Address

1. DOST Scholars’ Exit 2019 Butuan City

Conference
2. Seminar Workshop on the 2019 Surigao City
Development and Validation
Of Contextualized Learning
Materials
3. Pre-Deployment Orientation 2019 Surigao City
Seminar
4. Basic of MATLAB Programming 2018 Surigao City
_______________________________________________________________

ORGANIZATION

POSITION ORGANIZATION NAME YEAR

1. President Youth of COC 2015

2. Treasurer College of Arts and Sciences 2017-2018
_______________________________________________________________

IN CASE OF EMERGENCY, PLEASE NOTIFY:

Name Contact No.

1. Marites Bonono 09381599919

2. Sody Bonono 09093977136
Surigao State College of Technology
Surigao City
Surigao State College of Technology
Surigao City
Surigao State College of Technology
Surigao City
Surigao State College of Technology
Surigao City
Surigao State College of Technology
Surigao City