On px^2+q^2n=y^p and related Diophantine equations
From MaRDI portal
Publication:548048
DOI10.1016/J.JNT.2011.02.007zbMATH Open1229.11055arXiv1002.1041OpenAlexW1498225155MaRDI QIDQ548048FDOQ548048
Authors: Maurice Mignotte, Abdallah Laradji, Nikos Tzanakis
Publication date: 27 June 2011
Published in: Journal of Number Theory (Search for Journal in Brave)
Abstract: The title equation, where is a prime number , is an odd prime number and are positive integers with relatively prime, is studied. When , we prove (Theorem 2.3) that there are no solutions. For the treatment of the equation turns out to be a difficult task. We focus our attention to , 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 (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.
Full work available at URL: https://arxiv.org/abs/1002.1041
Recommendations
- On the Diophantine equation \(px^2+q^{2m}=y^p\)
- A note on the Diophantine equation \(px^2+q^{2n}=y^p\)
- On the Diophantine Equation 2 n + px 2 = y p
- On the Diophantine equation \(px^2+3^n=y^p\)
- scientific article; zbMATH DE number 4122057
- scientific article; zbMATH DE number 3096028
- scientific article; zbMATH DE number 2016897
- On the Diophantine equation \(x^2 + p^{2k} = y^n\)
- On the Diophantine equation x2+q2m=2yp
- On the Diophantine equation \(x^2+q^{2k+1}=y^n\)
Lehmer pairCyclotomic polynomialExponential Diophantine equationHypergeometric seriesLinear forms in two logarithms
Cites Work
- The Magma algebra system. I: The user language
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- Number Theory
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Classical and modular approaches to exponential Diophantine equations II. The Lebesgue–Nagell equation
- On Fibonacci numbers of the form \(q^ky^k\).
- Linear forms in two logarithms and interpolation determinants II
- On the Equations zm = F (x, y ) and Axp + Byq = Czr
- The Solution of 3y 2 ± 2 n = x 3
- On the Diophantine Equation 2 n + px 2 = y p
- On the Diophantine equation \(px^2+q^{2m}=y^p\)
- On the practical solution of the Thue equation
- On the Diophantine equation \(y^2=4q^n+4q+1\)
- The Diophantine equation \(x^ 2\pm \ell y^ 2=z^{\ell}\) connected with Fermat's Last Theorem
- Solving Thue equations of high degree
- On the diophantine equation \(x^ 2+2^ k=y^ n\)
- On the Diophantine equation \(px^2+3^n=y^p\)
- The Diophantine equation $x^p+1=py^2$
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Diophantine eaquations of the form ax2 + Db2 = yp.
- On the generalized Ramanujan-Nagell equation I
- On the generalized Ramanujan-Nagell equation, II
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Diophantine equation $x^{p}+2^{2m}=py^{2}$
Cited In (3)
Uses Software
This page was built for publication: On \(px^{2}+q^{2n}=y^{p}\) and related Diophantine equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548048)