On k-generalized Fibonacci numbers with negative indices
From MaRDI portal
Publication:3382902
DOI10.5486/PMD.2021.8912zbMATH Open1488.11048arXiv2008.10899OpenAlexW4245404493MaRDI QIDQ3382902FDOQ3382902
Authors: Attila Pethő
Publication date: 22 September 2021
Published in: Publicationes Mathematicae Debrecen (Search for Journal in Brave)
Abstract: In these notes we study the -generalized Fibonacci sequences - - with positive and negative indices. Denote its characteristic polynomial. Our most interesting finding is that if is even then the absolute value of the second real root of is minimal among the roots. Combining this with a deep result of Bugeaud and Kaneko cite{BK} we prove that there are only finitely many perfect powers in , provided is even. Another consequence is that, if and denote even integers then the equation has only finitely many effectively computable solutions in . In the case we establish all solutions of this equation.
Full work available at URL: https://arxiv.org/abs/2008.10899
Recommendations
- \(k\)-generalized Fibonacci numbers of the form \(1+2^{n_1}+4^{n_2}+\cdots +(2^{k})^{n_k}\)
- An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers
- Terms of generalized Fibonacci sequences that are powers of their orders
- Powers of two in generalized Fibonacci sequences
- An equation related to \(k\)-generalized Fibonacci numbers
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61) Computer solution of Diophantine equations (11Y50)
Cited In (12)
- Representations using negatively subscripted Fibonacci and Tribonacci numbers with applications
- On the size of roots of a family of polynomials related to linear recurrence sequences
- On the zero-multiplicity of the \(k\)-generalized Fibonacci sequence
- Solving Skolem's problem for the \(k\)-generalized Fibonacci sequence with negative indices
- On some properties of \(k\)-generalized Fibonacci numbers
- Even perfect numbers among generalized Fibonacci sequences
- Duplications In the \(k\)-generalized Fibonacci sequences
- Upper bound on the solution to F(2k)n = +F(2k)m with negative subscripts
- Common values of Padovan and Perrin sequences
- On the 2-adic valuation of generalized Fibonacci sequences
- Title not available (Why is that?)
- Common values of a class of linear recurrences
This page was built for publication: On \(k\)-generalized Fibonacci numbers with negative indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382902)