Multiplicative relations on binary recurrences
From MaRDI portal
Recommendations
- Diophantine equations with products of consecutive members of binary recurrences
- Multiplicities of binary recurrences
- An estimate for the multiplicity of binary recurrences
- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
- Linear combinations of prime powers in sums of terms of binary recurrence sequences
Cited in
(12)- Diophantine equations with products of consecutive members of binary recurrences
- Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
- The product of like-indexed terms in binary recurrences
- Finiteness results for Diophantine triples with repdigit values
- Multiplicative Diophantine equations with factors from different Lucas sequences
- On the shifted product of binary recurrences
- How can the product of two binary recurrences be constant?
- scientific article; zbMATH DE number 2201547 (Why is no real title available?)
- On multiplicative dependent vectors with coordinates from certain higher order recurrences
- Linear combinations of prime powers in sums of terms of binary recurrence sequences
- Multiplicative dependence of k-Fibonacci numbers with the Fibonacci, Lucas, and Pell sequences
- Multiplicative dependence in linear recurrence sequences
This page was built for publication: Multiplicative relations on binary recurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859341)
