Multiplicative Diophantine equations with factors from different Lucas sequences
From MaRDI portal
(Redirected from Publication:311474)
Recommendations
Cites work
- scientific article; zbMATH DE number 1995937 (Why is no real title available?)
- scientific article; zbMATH DE number 1484667 (Why is no real title available?)
- scientific article; zbMATH DE number 2152659 (Why is no real title available?)
- scientific article; zbMATH DE number 3185064 (Why is no real title available?)
- 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
- Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
- Multiplicative independence in k-generalized Fibonacci sequences
- Multiplicative properties of the partition function
- Multiplicative relations on binary recurrences
- Multiplicatively dependent triples of Tribonacci numbers
- Number Theory
- On divisors of Lucas and Lehmer numbers
- On integers with identical digits
- On the counting function of irregular primes
- On the intersections of Fibonacci, Pell, and Lucas numbers
- Pell and Pell-Lucas numbers with only one distinct digit
- Perfect Pell Powers
Cited in
(6)- scientific article; zbMATH DE number 1408158 (Why is no real title available?)
- Multiplicative dependence between Padovan and Perrin numbers
- Consecutive tuples of multiplicatively dependent integers
- Multiplicative dependent pairs in the sequence of Padovan numbers
- On multiplicative dependent vectors with coordinates from certain higher order recurrences
- Additive Diophantine equations with binary recurrences, \(\mathcal{S}\)-units and several factorials
This page was built for publication: Multiplicative Diophantine equations with factors from different Lucas sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q311474)