English

On $px^2 + q^{2n}= y^p$ and related Diophantine equations

Number Theory 2021-08-27 v4

Abstract

The title equation, where p>3p>3 is a prime number ≢7(mod8)\not\equiv 7 \pmod 8, qq is an odd prime number and x,y,nx,y,n are positive integers with x,yx,y relatively prime, is studied. When p3(mod8)p\equiv 3\pmod 8, we prove (Theorem 2.3) that there are no solutions. For p≢3(mod8)p\not\equiv 3\pmod 8 the treatment of the equation turns out to be a difficult task. We focus our attention to p=5p=5, by reason of an article by F. Abu Muriefah, published in this journal, vol. 128 (2008), 1670-1675. Our main result concerning this special equation is Theorem 1.1, whose proof is based on results around the Diophantine equation 5x24=yn5x^2-4=y^n (integer solutions), interesting in themselves, which are exposed in Sections 3 and 4. These last results are obtained by using tools such as Linear Forms in Two Logarithms and Hypergeometric Series.

Keywords

Cite

@article{arxiv.1002.1041,
  title  = {On $px^2 + q^{2n}= y^p$ and related Diophantine equations},
  author = {A. Laradji and M. Mignotte and N. Tzanakis},
  journal= {arXiv preprint arXiv:1002.1041},
  year   = {2021}
}

Comments

22 pages. In this version, Theorem 3.2 is corrected and relevant remarks are added. A few misprints are also corrected