A note on the Diophantine equation x^2 =4p^n -4p^m +^2
Let \(l\) be a fixed odd positive integer and consider the Diophantine equation \[ x^2=4p^{n}-4p^{m}+l^2. \] This is particular case of a generalized Ramanujan-Nagell equation. The authors are interested in solutions \((p, x, m, n)\), where \(p\) is a prime number and \(x, m, n\) are positive integers and obtain full characterization of solutions in the case when \(l^2<4p^{m}\), \(\gcd(x,l)=1\) and \(m<n\). To be more precise, under mentioned conditions, the main result states that the solutions exist only in the case when \(l=3, 5, 9, 11\). For example, if \(l=11\), then the only solutions are \((p, x, m, n)=(2, 181, 5, 13)\). The proof uses combination of classical results concerning integer solutions of certain classes of Ramanujan-Nagell equations together with a simple use of linear forms in logarithms.
- An upper bound for least solutions of the exponential Diophantine equation D₁x^2 - D₂y^2 = k^z
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- scientific article; zbMATH DE number 3758416 (Why is no real title available?)
- Linear forms in two logarithms and interpolation determinants II
- On the Diophantine equation y^2-D=2ᵏ
- On the diophantine equation 𝑥²=4𝑞^{𝑚}-4𝑞ⁿ+1
- On the generalized Ramanujan-Nagell equation $x^{2} - D = p^{n}$
- On the number of solutions of the generalized Ramanujan-Nagell equation
- Squares with Three Nonzero Digits
- The diophantine equation x^ 2=4q^ n-4q+1
- The diophantine equation \(x^ 2=4q^{a/2}+4q+1\), with an application to coding theory
- The Diophantine Equation x 2 = 4q n + 4q m + 1
- Two-weight ternary codes and the equation y^2=4 3^+13
This page was built for publication: A note on the Diophantine equation \(x^2 =4p^n -4p^m +\ell^2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095064)