INTERNATIONAL JOURNAL OF LATEST TECHNOLOGY IN ENGINEERING,
MANAGEMENT & APPLIED SCIENCE (IJLTEMAS)
ISSN 2278-2540 | DOI: 10.51583/IJLTEMAS | Volume XIII, Issue V, May 2024
www.ijltemas.in Page 215
On the Exponential Diophantine Equation
Wariam Chuayjan, Theeradach Kaewong, and Sutthiwat Thongnak
*
Department of Mathematics and Statistics, Faculty of Science and Digital Innovation, Thaksin
University, Phatthalung 93210, Thailand.
*
Corresponding Author
DOI: https://doi.org/10.51583/IJLTEMAS.2024.130522
Received: 17 May 2024; Revised: 01 June 2024; Accepted: 06 June 2024; Published: 22 June 2024
Abstract: In this work, the exponential Diophantine equation
are non-negative integers, was
studied and presented with the theorems governing its expressions. The result indicated that
was a unique
solution to the equation.
Keywords: divisibility; exponential Diophantine equation; modular arithmetic; prime number
Mathematics Subject Classification: 11D61, 11D72, 11D45.
I. Introduction
Almost a decade ago, the exponential Diophantine equations of the form
are positive integers,
have been studied by researchers. They solved the individual equations based on knowledge of number theory. In 2018, Rabago
[3] studied the exponential Diophantine equations
. He also proved all solutions to the
equation
. The Mihailescus Theorem (Catalan’s conjecture) was
applied in these proofs. In 2019, S. Thongnak et al. [7] studied the equation
. The result was obtained by using
Mihailescus Theorem and modular arithmetic. In 2020, M. Buosi et al. [1] discovered non-negative integer solutions to
. In [2] A. Elshahed and H. Kamarulhaili proved all non-negative integer solutions to
the equation
1
,1,2 1,2 1
nk nk
k
. The exponential Diophantine
equation
was solved by S. thongnak et al (see in [8]). They proved that equation has only the trivial solution
. Recently, many exponential Diophantine equations have been solved (see in [4], [5], [9-11]).
According to previous works, the exponential Diophantine equation problem is a challenging because there is no general method
to determine solutions. In this work, we solve the exponential Diophantine equation
are
non-negative integers. We applied the greatest common divisor and order of modular in the proof all solutions to the equation.
II. Preliminaries
In this section, we introduce basic knowledge applied in this proof.
Definition 2.1 [6] Let
be given integers, with at least one of them different from zero. The greatest common divisor of
, is the positive integer
satisfying the following:
(a)
is a positive integer and
, the least positive integer
be a positive integer, and
are positive
integers then