A note on the Diophantine equations $x^{2}\pm5^{\alpha}\cdot p^{n}=y^{n}$
G\"okhan Soydan

TL;DR
This paper proves that certain exponential Diophantine equations involving powers of 5, a prime p not equal to 2 or 5, and exponents n ≥ 7 have no solutions under specified conditions, extending understanding of these equations.
Contribution
It establishes the non-existence of solutions for the equations x^2 ± 5^α p^n = y^n with specified constraints, for primes p ≠ 2,5 and n ≥ 7.
Findings
No solutions in positive integers for the given equations under specified conditions.
Extends previous results on exponential Diophantine equations involving prime powers.
Provides new insights into the structure of solutions for equations with mixed powers.
Abstract
Suppose that is odd, and are primes. In this paper, we prove that the Diophantine equations have no solutions in positive integers with .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Algebraic Geometry and Number Theory · Advanced Mathematical Theories and Applications
A note on the Diophantine equations
GÖKHAN SOYDAN
Abstract
Suppose that is odd, and are primes. In this paper, we prove that the Diophantine equations have no solutions in positive integers with .
††2010 Mathematics Subject Classification: 11D61.††Key words and phrases: Exponential Diophantine equation, Frey curve.††This work was supported by the Research Fund of Uludağ University under project numbers: 2015/23, 2016/9.
1 Introduction
The Diophantine equation
[TABLE]
where is a product of at least two prime powers were studied in some recent papers. First we assume that is an odd prime. All solutions of the Diophantine equation (1.1) where were given in [15] for , in [17] for , in [6] for , in [19] for , in [9] for , in [27] for . Next assume that is a general odd prime. In [29], Zhu, Le, Soydan and Tógbe gave all the solutions of the equation under some conditions.
Many authors also considered the Diophantine equation (1.1) where is a product of at least two distinct odd primes. The cases and when and are coprime were solved completely in [18] and [21], respectively. In 2010, the complete solution of the Diophantine equation (1.1) for the case when except for the case when is odd, was given by Cangul, Demirci, Soydan and Tzanakis, [7]. Six years later, the remaining case of the Diophantine equation (1.1) for the case were covered by Soydan and Tzanakis, [26]. All solutions of the Diophantine equation (1.1) for the cases -except for the case when is odd and is even-, , , , and - can be found in [24]-[25], [4], [13], [5], [11] and [12], respectively. In [20], Pink gave all the non-exceptional solutions of the equation (1.1) (according to terminology of that paper) for the case . For a survey concerning equation (1.1) see [4], [2].
Now we assume that and are primes. Here we consider the Diophantine equations
[TABLE]
and
[TABLE]
where , and There are many papers concerning partials solutions for the equations (1.2) and (1.3). The known results except the ones mentioned above include the following theorem.
Theorem 1.1**.**
* Let be an odd prime with and where denote the class number of the field . Under these conditions if , then the equation (1.2) has no solutions.
Let be a prime. If , then (1.3) has no solutions.*
Proof. See [1].
See [10].
Our main result is following.
Theorem 1.2**.**
Suppose that is odd, and are primes. Then the Diophantine equations
[TABLE]
and
[TABLE]
have no solutions in positive integers with .
Here the equation (1.4) is an extension of the equation (1.1) the cases when , , in [7], [26], [18], [21], respectively.
2 Preliminaries
This section introduces some well known notions and results that will be used to prove the main result.
2.1 The modular method
The most important progress in the field of the Diophantine equations has been with Wile’s proof of Fermat’s Last Theorem [28]. His proof is based on deep results about Galois representations associated to elliptic curves and modular forms. The method of using such results to deal with Diophatine problems, is called the modular method. Especially modular method is useful to solve Diophantine equations of the form
[TABLE]
Modular method follows these steps: associate to a (hypotetical) solution of such a Diophantine equation a certain elliptic curve, called a Frey curve, with discriminant an explicitly known constant times a -th power. Next (under some technical assumptions) apply Ribbet’s level lowering theorem [22] to show that Galois representation on the -torsion of the Frey curve occurs from a newform of weight 2 and a fairly small level say. If there are no such newforms then there are no non-trivial111A solution to the equation with , , is called nontrivial if . solutions to the original Diophantine equation.
Now we stop here, since we only need some of these steps of the modular method in this work (For the details concerning modular method see [8, Chapter 15] and [23]).
2.2 Signature
Here we follow the paper of Siksek [23, Section 14] and we give recipes for signature which was firstly described by Bennett and Skinner [3]. (See also [14]).
Assume that is prime and and are nonzero integers with , and pairwise coprime, satisfying
[TABLE]
We suppose that
[TABLE]
and
[TABLE]
With assumptions and notation as above without loss of generality, we may suppose we are in one of the following situations:
and .
and either or .
, and .
, and .
and .
In cases and , we will consider the curve
[TABLE]
In cases and , we will consider
[TABLE]
in case ,
[TABLE]
These are all elliptic curves defined over
The following theorem [23, Theo. 16] summarizes some useful fact about these curves.
Theorem 2.1**.**
(Bennett and Skinner, [3]) Let or .
* The discriminant of the curve is given by*
[TABLE]
where
[TABLE]
* The conductor of the curve is given by*
[TABLE]
where
[TABLE]
* Suppose that does not have complex multiplication (This would follow if we assume that ). Then for some newform of level*
[TABLE]
where
[TABLE]
* The curves have non-trivial 2-torsion.*
Finally we give an important result [23, Theo. 1] about newforms.
Theorem 2.2**.**
There are no newforms at levels 1, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 16, 18, 22, 25, 28, 60.
Now we are ready to prove Theorem 1.2.
3 The proof of Theorem 1.2
First suppose that is a solution to (1.4) where is odd, and are primes. Thus the equation (1.4) becomes
[TABLE]
with . We may assume without loss of generality that . With the notation in (2.1), we see that (3.1) is a ternary equation of signature . We have the following notations which satisfy (2.2)
[TABLE]
Since is even, and , then with the case (in page ) we are interested in the following elliptic curve (called a Frey curve)
[TABLE]
According to the cases and of Theorem 2.1, we write the discriminant and conductor of this elliptic curve, respectively
[TABLE]
where in the last product is odd prime. With the case of Theorem 2.1 we compute the level ( prime). But Theorem 2.2 tells us that there is no newform of level . Thus we deduce the equation (3.1) has no solutions where is odd, and are primes.
For the case , we can write the equation (1.5) as follows.
[TABLE]
Following same steps as the case , we see that (3.2) has no solutions where and are primes. So the proof of theorem is completed.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. A. Arif, F.S. Abu Muriefah On the Diophantine equation x 2 + q 2 k + 1 = y n superscript 𝑥 2 superscript 𝑞 2 𝑘 1 superscript 𝑦 𝑛 x^{2}+q^{2k+1}=y^{n} , J. Num. Th. 95 (2002), no. 1, 95-100.
- 2[2] F.S. Abu Muriefah, Y. Bugeaud, The Diophantine equation x 2 + C = y n superscript 𝑥 2 𝐶 superscript 𝑦 𝑛 x^{2}+C=y^{n} : a brief overview , Revis. Col. Math. 40 (2006), no. 1, 31-37.
- 3[3] M.A. Bennett, C.M. Skinner, Ternary Diophantine equations via Galois representations and modular forms , Canad. J. Math. 56 (2004), no. 1, 23-54.
- 4[4] A. Berczés, I. Pink, On generalized Lebesgue-Ramanujan-Nagell equations , An. Şt. Univ. Ovid. Cons. 22 (2014), no. 1, 51-71.
- 5[5] I.N. Cangul, M. Demirci, F. Luca, I. Inam, G. Soydan, On the Diophantine equation x 2 + 2 a 3 b 11 c = y n superscript 𝑥 2 superscript 2 𝑎 superscript 3 𝑏 superscript 11 𝑐 superscript 𝑦 𝑛 x^{2}+2^{a}3^{b}11^{c}=y^{n} , Math. Slovaca 63 (2013), no. 3, 647-659.
- 6[6] I.N. Cangul, M. Demirci, F. Luca, Á. Pintér, G. Soydan, On the Diophantine equation x 2 + 2 a 11 b = y n superscript 𝑥 2 superscript 2 𝑎 superscript 11 𝑏 superscript 𝑦 𝑛 x^{2}+2^{a}11^{b}=y^{n} , Fibonacci Quart. 48 (2010), no. 1, 39-46.
- 7[7] I.N. Cangul, M. Demirci, G. Soydan, N. Tzanakis, On the Diophantine equation x 2 + 5 a 11 b = y n superscript 𝑥 2 superscript 5 𝑎 superscript 11 𝑏 superscript 𝑦 𝑛 x^{2}+5^{a}11^{b}=y^{n} , Funct. Approx. 43 (2010), no. 2, 209-225.
- 8[8] H. Cohen, Number Theory Vol. II: Analytic and Modern Tools, Springer, (2007).
