Multiplicative independence in the sequence of $k$-generalized Lucas numbers
Preprint
Abstract
Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$-generalized Lucas numbers for some fixed integer $k\ge 2$, whose first $k$ terms are $0,\;\ldots\;,\;0,\;2,\;1$ and each term afterward is the sum of the preceding $k$ terms. In this paper, we find all pairs of the $k$-generalized Lucas numbers that are multiplicatively dependent.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Multiplicative dependence between Padovan and Perrin numbersBoletín de la Sociedad Matemática Mexicana, 2023
- Multiplicative dependence between k-Fibonacci and k-Lucas numbersPeriodica Mathematica Hungarica, 2020
- Existence of primitive divisors of Lucas and Lehmer numbersJournal für die reine und angewandte Mathematik (Crelles Journal), 2001
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. IIIzvestiya: Mathematics, 2000
- Solving Generalized Fibonacci RecurrencesThe Fibonacci Quarterly, 1998
- Solving exponential diophantine equations using lattice Basis Reduction AlgorithmsJournal of Number Theory, 1987
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982