On the Diophantine equation x^2+D^m=p^n
Let \(D>2\) and \(p\) an odd prime which does not divide \(D\). The authors prove that -- except in the two cases \((D,p)= (4,5),\,(2,5)\) -- the Diophantine equation \(x^2+D^m=p^n\) has at most two positive solutions \((x,mn)\). Notice that the equations \(x^2+4^m=5^n\) and \(x^2+4^m=5^n\) have exactly three solutions. The proof uses a deep result of Bilu-Hanrot-Voutier on primitve divisors of Lucas-Lehmer sequences and elementary arguments, in particular the computation of suitable Jacobi symbols (a classical method for this kind of equations).
- Applications of Jacobi's symbol to Lehmer's numbers
- Classical and modular approaches to exponential Diophantine equations II. The Lebesgue–Nagell equation
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- scientific article; zbMATH DE number 3830444 (Why is no real title available?)
- scientific article; zbMATH DE number 3151695 (Why is no real title available?)
- On some exponential Diophantine equations
- On the number of solutions of the generalized Ramanujan-Nagell equation
- Primitive Divisors of Lucas and Lehmer Sequences
- The diophantine equation $x^{2} + D^{m} = p^{n}$
- On the Diophantine equation \(x^2+5^m=y^n\)
- A polynomial-exponential equation related to the Ramanujan-Nagell equation
- On the Diophantine equation \(X^2-(p^{2m}+1)Y^6=-p^{2m}\)
- On the generalized Ramanujan-Nagell equation \(x^2+(2c-1)^m=c^n\)
- On the Diophantine equation \(d_1x^2+4d_2=y^n\)
- Squares in Lehmer sequences and some Diophantine applications
- On Some Equations Related to Ma's Conjecture
- On the Diophantine equation 2ᵐ + nx^2 = y^n
- scientific article; zbMATH DE number 4122057 (Why is no real title available?)
- scientific article; zbMATH DE number 1912084 (Why is no real title available?)
- A GENERALIZATION OF THE RAMANUJAN–NAGELL EQUATION
- A note to the exponential Diophantine equation x^2+D^m=p^n
- On the Diophantine equation \(dx^2+p^{2a}q^{2b}=4y^p\)
- On the Diophantine equation \(px^2+q^{2m}=y^p\)
- On the Diophantine equation \(x^2 + p^{2k} = y^n\)
This page was built for publication: On the Diophantine equation \(x^2+D^m=p^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565547)