Multiplicative Diophantine equations with factors from different Lucas sequences
From MaRDI portal
Publication:311474
DOI10.1016/j.jnt.2016.06.006zbMath1402.11025OpenAlexW2478572106MaRDI QIDQ311474
Florian Luca, Carlos Alexis Gómez Ruiz
Publication date: 13 September 2016
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2016.06.006
binary recurrent sequenceslower bounds for nonzero linear forms in logarithms of algebraic numbersmultiplicatively independent integers
Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)
Related Items
Multiplicative dependent pairs in the sequence of Padovan numbers ⋮ Multiplicative dependence between Padovan and Perrin numbers
Cites Work
- On divisors of Lucas and Lehmer numbers
- On the counting function of irregular primes
- Multiplicative independence in \(k\)-generalized Fibonacci sequences
- Multiplicative properties of the partition function
- Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
- Multiplicative relations on binary recurrences
- On the Intersections of Fibonacci, Pell, and Lucas Numbers
- Multiplicatively dependent triples of Tribonacci numbers
- On integers with identical digits
- Perfect Pell Powers
- Number Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
