Scribd
Upload
11 views4 pages

R Venkatramn Muthuvel2

Qqqq

Uploaded by

Öabt Hocası
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views4 pages

R Venkatramn Muthuvel2

Qqqq

Uploaded by

Öabt Hocası
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

b b

International Journal of Mathematics and M


Computer Science, 19(2024), no. 4, 1125–1128 CS

An Exponential Diophantine Equation


x2 + 3a97b = y n

S. Muthuvel, R. Venkatraman

Department of Mathematics
Faculty of Engineering and Technology
SRM Institute of Science and Technology, Vadapalani Campus
No. 1, Jawaharlal Nehru Salai
Vadapalani, Chennai-600026, Tamilnadu, India

email: [email protected], [email protected],


[email protected]

(Received March 7, 2024, Accepted April 17, 2024,


Published June 1, 2024)

Abstract
In this paper, we determine all positive integer solutions (x, y, n, a, b)
of the equation x2 + 3a 97b = y n for non-negative integers a and b un-
der the condition that the non-negative integers x and y are relatively
prime, n ≥ 3.

1 Introduction
In recent years, many papers dealt with the Diophantine equation

x2 + pα1 1 . . . pαk k = y n , n ≥ 3, gcd(x, y) = 1

in non-negative integers (x, y, α1, . . . , αk ), where p′i s are fixed prime num-
bers. With the development of modern tools such as the Primitive Divisor
Theorem, the modular approach, and the computational techniques, many
authors investigated the above equation when k ≥ 1. In particular, the cases
(p1 , p2 ) ∈ {(2, 3), (3, 41)} were considered in [3, 1].
Key words and phrases: Diophantine equations, Integer solution,
S-integers, Lucas sequence, Primitive divisor
AMS (MOS) Subject Classifications: 11D61, 11D59, 11Y50.
The corresponding author is R. Venkatraman.
ISSN 1814-0432, 2024, http://ijmcs.future-in-tech.net
1126 S. Muthuvel, R. Venkatraman

2 Preliminaries
The Lucas pair, denoted as (η, η), involves algebraic integers satisfying spe-
cific conditions. These pairs generate Lucas numbers through the formula
n −η n
Ln (η, η) = η η−η . The existence of primitive divisors for these Lucas num-
bers is vital. A prime number is considered a primitive divisor of Ln (η, η) if
Qpn−1
2
p | Ln (η, η) and p ∤ (η −η)  Li (η, η) for n > 1. In addition, a primitive
i=1
2
divisor q satisfies q ≡ (η−η)
q
(mod n), where ( ∗q ) denotes the Legendre
symbol. For n > 4 and n 6= 6, all n-th terms of Lucas sequences have
primitive divisors, excluding specific values of η, η, and n [2].

3 Main Result
Theorem 3.1. For n ≥ 3, a, b ≥ 0, the only solutions of the equation
x2 + 3a 97b = y n , x, y ≥ 1, gcd(x, y) = 1 (3.1)
are given by (x, y, a, b) ∈ {(1405096, 12545, 0, 2), (530, 79, 7, 1), (1144, 115, 7, 1),
(48664, 1555, 15, 1), (46, 13, 4, 0), (730, 109, 4, 2), (10, 7, 5, 0), (3428, 307, 11, 1),
(1034, 103, 5, 1), (7730, 391, 5, 1), (871680070, 912511, 11, 3)} when n = 3 and
(x, y, a, b) = (48, 7, 0, 1) when n = 4.
Proof. The proof of the theorem will be investigated for cases of n = 3,
n = 4, and n ≥ 5 as follows:
Case 1: When n = 3, let a = 6a1 +i and b = 6b1 +j, where i, j ∈ {0, 1, . . . , 5}.
Equation (3.1) transforms into the elliptic curve L2 = M 3 − 3i 97j with
L = 33a1 x973b1 and M = 32a1 y972b1 . Therefore, we need to calculate all {3, 97}-
integral points on 36 elliptic curves for each i and j. We use MAGMA to
determine all the {3, 97}- integral points on the above elliptic curves satisfy-
ing gcd(numerator(L), numerator(M)) = 1 and check for the desired solu-
tions. All the solutions are (x, y, a, b) ∈ {(1405096, 12545, 0, 2), (530, 79, 7, 1),
(1144, 115, 7, 1), (48664, 1555, 15, 1), (46, 13, 4, 0), (730, 109, 4, 2), (10, 7, 5, 0),
(3428, 307, 11, 1), (1034, 103, 5, 1), (7730, 391, 5, 1), (871680070, 912511, 11, 3)}.
Case 2: When n = 4, let a = 4α1 +i and b = 4β1 +j, where i, j ∈ {0, 1, 2, 3}.
Equation (3.1) transforms into A2 = B 4 − 3i 97j , with A = 32α1 x972β1 and
B = 3α1 y97β1 . Identifying {3, 97}-integral points on 16 quartic curves corre-
sponds to finding integer solutions of Equation (3.1). Using SIntegralLjung-
grenPoints, we determine all S-integral points on these curves, resulting in
(A, B, i, j) = (∓1, 0, 0, 0), (∓7, 48, 0, 1). Considering the condition on x and
y, Equation (3.1) has a solution (x, y, a, b) = (48, 7, 0, 1).
An Exponential Diophantine Equation x2 + 3a 97b = y n 1127

Case 3: Now, suppose that n ≥ 5. If there exists a solution for Equation


(3.1) with n = 2k and k ≥ 3, it can be obtained from solutions with n = 4
 4
k k−2
since y 2 = y 2 . Consequently, there are no solutions for (3.1) with
n = 2k and k ≥ 3. Similarly, (3.1) has no solution for n = 3k and k ≥ 2.
Hence, without loss of generality, n is an odd prime. Let’s initiate
√ the analysis
of the √factorization√of Equation (3.1) in the field K = Q( −d) as follows:
(x + e −d)(x − e −d) = y n where e = 3α 97β for some integers α, β ≥ 0
and d ∈ {1, 3, 97, 291}. Assuming that y is even leads to a contradiction as x
must be odd according to (3.1) and so 1 + 3α ≡ 0 (mod √ 8). As a result, √ y is
an odd integer and therefore the ideals formed by (x+e −d) and (x−e −d)
are relatively prime in K. The class number h(K) takes on one of two values
1 or 4 for the choice of d. Thus, we can deduce that gcd(n, h(d)) = 1. Since
d 6≡ 3 (mod 4) and n is also coprime to the order of the unit group of OK ,
we can write
√ √ √ n √
x + e −d = ξ n = (s + t −d)n , x − e −d = ξ = (s − t −d)n

and y = s2 + dt2 for some rational integers s and t. By n


analyzing these equa-
ξ n −ξ
tions, we can derive that e = Ln t, where Ln = ξ−ξ . Notably, the sequence
Ln is a Lucas sequence. The Lucas sequences without primitive divisors are
explicitly enumerated in [2], and it is confirmed that Ln doesn’t match any
of them. Consequently, we delve into the possibility that a primitive divisor
may exist for Ln . Assume q is any primitive divisor of Ln . In this case, q
is either 3 or 97. Considering that any primitive divisor q ≡ ±1( mod n),
we rule out the possibility q = 3 given that n ≥ 5. Thus, we continue with
q = 97. According to the definition of a primitive
 2  divisor, q ∤ (ξ−ξ)2 = −4dt2 ,

indicating that d = 1. Moreover, since −4t q
= −1 97
= 1, we deduce that
97 ≡ 1 (mod n). Since the only possible values for n are 2 and 3, this con-
tradicts the assumption made in case 3. Consequently, no such n exists for
n ≥ 5. This completes the proof.
1128 S. Muthuvel, R. Venkatraman

References
[1] M. Alan, U. Zengin, On the Diophantine equation x2 + 3a 41b = y n ,
Period. Math. Hung., 81, (2020), 284–291.

[2] Y. Bilu, G. Hanrot, P.M. Voutier, (with an Appendix by M. Mignotte),


Existence of primitive divisors of Lucas and Lehmer numbers, J. Reine
Angew. Math., 539, (2001), 75–122.

[3] F. Luca, On the equation x2 + 2a 3b = y n , Int. J. Math. Math. Sci., 29,


no. 3, (2002), 239–244.

You might also like