A Lucas-Lehmer approach to generalised Lebesgue-Ramanujan-Nagell equations
The main result of the paper under review is the following, which is Theorem 1 in the paper. Assume that \(C_1\), \(C_2\) are coprime positive integers with \(C_1\) squarefree and \(C_1C_2\not\equiv 7\pmod 8\). Write \(C_1C_2=cd^2\), where \(c\) is squarefree. Assume that the Diophantine equation \[ C_1x^2+C_2=y^p \] has a solution with \(p\) an odd prime in positive integers \((x,y)\) such that \(\gcd(C_1x^2,C_2,y^p)=1\). Then either \begin{itemize} \item[(i)] \(p\le 5\), or \item[(ii)] \(p=7\) and \(y=3,5,9\), or \item[(iii)] \(p\) divides the class number of \({\mathbb Q}({\sqrt{-c}})\), or \item[(iv)] \(p\) divides \(q-(-c|q)\) for some prime \(q\mid d\) and \(q\nmid 2c\), where \((-c|q)\) is the Legendre symbol. \end{itemize} The proof uses the classification theorem of \textit{Yu. Bilu} et al. [J. Reine Angew. Math. 539, 75--122 (2001; Zbl 0995.11010)] of members of Lucas sequences with complex conjugated roots which have no primitive divisors. The author also solves all the above equations for \((C_1,C_2)\) in the range \(2\le C_1\le 10\) and \(1\le C_2\le 80\) subject to the above assumptions namely that \(C_1, C_2\) are coprime, \(C_1\) is squarefree, \(C_1C_2\not\equiv 7\pmod 8\) and the solution \((x,y)\) satisfies \(\gcd(C_1x^2,C_2,y^p)=1\). She additionally also allows \(p\) to be equal to \(4\). For this computation, the author uses Magma to solve the corresponding Thue equations once a list of possible candidates for \(p\) has been obtained from (i)--(iv) above. There are \(42\) such solutions.
- On the Diophantine equation \(Cx^2+D=2y^q\)
- A note on the exponential Diophantine equation \(a^x+b^y=c^z\)
- On the Diophantine equation \(x^2+ c^{2m}= y^n\)
- scientific article; zbMATH DE number 5063069
- On the Diophantine equation x^2+2ᵏ=y^n. II
- scientific article; zbMATH DE number 1875768
- scientific article; zbMATH DE number 5846337
- On Some Equations Related to Ma's Conjecture
- On a generalization of the Lucas functions
- A simple proof of Carmichael's theorem on primitive divisors
- A brief survey on the generalized Lebesgue-Ramanujan-Nagell equation
- Classical and modular approaches to exponential Diophantine equations II. The Lebesgue–Nagell equation
- Computing integral points on elliptic curves
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- Factoring polynomials with rational coefficients
- scientific article; zbMATH DE number 6476582 (Why is no real title available?)
- scientific article; zbMATH DE number 1200746 (Why is no real title available?)
- On the Diophantine equation \(Cx^2+D=2y^q\)
- On the Diophantine equation \(x^ 2+a^ 2=2y^ p\).
- ON THE DIOPHANTINE EQUATION x2 + C = 2yn
- On the Diophantine equation x2+q2m=2yp
- On the diophantine equations x2 + 74 = y5 and x2 + 86 = y5
- Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms
- Ternary Diophantine Equations via Galois Representations and Modular Forms
- The diophantine equation x2+C=yn, II
- The diophantine equation x² + C = yⁿ
- The Magma algebra system. I: The user language
- On perfect powers that are sums of cubes of a seven term arithmetic progression
- scientific article; zbMATH DE number 6476582 (Why is no real title available?)
- scientific article; zbMATH DE number 6179336 (Why is no real title available?)
- On a class of Lebesgue-Ramanujan-Nagell equations
- On the exponential Diophantine equation \(x^2+p^m q^n=2y^p\)
- Power values of power sums: a survey
- On differences of perfect powers and prime powers
- Gaps between cubes with perfect power sum
- On the Diophantine equation \(Cx^2+D=2y^q\)
This page was built for publication: A Lucas-Lehmer approach to generalised Lebesgue-Ramanujan-Nagell equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052846)
