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

From MaRDI portal
Publication:548048



Abstract: The title equation, where p>3 is a prime number otequiv7pmod8, q is an odd prime number and x,y,n are positive integers with x,y relatively prime, is studied. When pequiv3pmod8, we prove (Theorem 2.3) that there are no solutions. For potequiv3pmod8 the treatment of the equation turns out to be a difficult task. We focus our attention to p=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 5x2−4=yn (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.




Cites work



Describes a project that uses

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)