Shifted powers in Lucas-Lehmer sequences
Let \(\{u_n\}_{n\ge 0}\) be a binary recurrent sequence of integers. Under mild hypotheses, \textit{T. N. Shorey} and \textit{C. L. Stewart} [Math. Scand. 52, 24--36 (1983; Zbl 0491.10016)] showed that for fixed integers \(a,b\), the equation \(u_n+a=by^p\) has only finitely many integer solutions \((n,p,y)\) which are effectively computable. However, the bounds arising from their method are too large for any practical application. In the paper under review, the authors present a method for finding all such solutions in the particular case when \(\{u_n\}_{n\ge 0}\) is a Lucas sequence whose characteristic equation has roots which are quadratic units generating a real quadratic field \({\mathbb K}\). The authors illustrate their approach by finding all the solutions to the equation \(F_n\pm 2=y^p\), where \(\{F_n\}_{n\ge 0}\) is the Fibonacci sequence. In this case, the authors reduce the above equation to a ternary equation attached to a Frey-Hellegouarch curve of signature \((p,p,2)\) defined over \({\mathbb K}={\mathbb Q}({\sqrt{5}})\) for which the authors apply a combination between the information obtained by level lowering of the mod \(p\) representation of the appropriate curve and linear forms in two and three logarithms. The bounds are still very large (\(p<5000\) and \(n<10^{5\times 10^6}\)), and to finish the problem they reduce them using a modular sieve based on a Chinese Remainder Theorem by putting every such putative \(n\) into some residue class modulo various appropriate primes.
- On the Diophantine equation 𝑈_{𝑛}-𝑏^{𝑚}=𝑐
- On \(Y\)-coordinates of Pell equations which are members of a fixed binary recurrence
- Perfect powers from products of terms in Lucas sequences
- Linear forms in Lucas numbers
- The Diophantine equations \(P_n^x+P_{n+1}^y=P_m^x\) or \(P_n^y+P_{n+1}^x=P_m^x\)
- Members of Lucas sequences whose Euler function is a power of 2
- On a variant of Pillai’s problem with binary recurrences and S-units
- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
- scientific article; zbMATH DE number 426359
- Divisibility properties of binary recurrent sequences
- Advanced Topics in Computional Number Theory
- Almost powers in the Lucas sequence
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Criteria for irreducibility of mod p representations of Frey curves
- Elliptic curves over real quadratic fields are modular
- Explicit methods for Hilbert modular forms
- Fibonacci numbers at most one away from a perfect power
- scientific article; zbMATH DE number 1200746 (Why is no real title available?)
- scientific article; zbMATH DE number 706265 (Why is no real title available?)
- scientific article; zbMATH DE number 814533 (Why is no real title available?)
- Integral points on elliptic curves over number fields
- Integral points on hyperelliptic curves
- Linear forms in two and three logarithms and interpolation determinants
- Linear forms in two logarithms and interpolation determinants II
- On a question of B. Mazur
- On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
- Perfect powers in second order linear recurrences
- Shifted powers in binary recurrence sequences
- Sur l'équation a3+ b3= cp
- The asymptotic Fermat's last theorem for five-sixths of real quadratic fields
- The Magma algebra system. I: The user language
- On the l.c.m. of shifted Lucas numbers
- On the nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\)
- Shift-inequivalent decimations of the Sidelnikov-Lempel-Cohn-Eastman sequences
- ON PERFECT POWERS IN LUCAS SEQUENCES
- The Diophantine equation F_n=P(x)
- On the least common multiple of shifted powers
- Shifted powers in binary recurrence sequences
- Powers in Lucas sequences via Galois representations
- On elliptic curves with p-isogenies over quadratic fields
- Perfect powers in elliptic divisibility sequences
- Blind RSA signatures from the t- generalized Lehmer sequences of some classes of groups
- On the sum of fifth powers in arithmetic progression
- New signature schemes from the Hadamard-type (k, t)-generalized Jacobsthal-Lehmer sequences on the (2)-generator p-group of nilpotency class 2
- Affine-Hill cipher key generation using self-invertible matrices from k-division L-Lehmer-Pell sequences
- An RSA cryptosystem based on Lehmer sequences in some classes of groups
- A blind signature scheme based on new cyclic groups
- On the solutions of the Diophantine equation F_n F_m=3s y^b
This page was built for publication: Shifted powers in Lucas-Lehmer sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316334)
