A New Bound on The Growth of K-Generalized Fibonacci Sequences and An Application to Linear Diophantine Representations
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Generalized Fibonacci sequences, also known as k-bonacci sequences, are extensions of the classical Fibonacci sequence that incorporate k previous terms into their recurrence relation. These sequences have wide applications in number theory, combinatorics, computer science, and applied mathematics. The present paper provides an explicit exponential bound for the growth of k-generalized Fibonacci numbers, expressed in terms of the dominant root αₖ of the corresponding characteristic polynomial. The derived inequality simplifies asymptotic estimates and offers practical benefits for Diophantine analysis and recurrence-based modeling. Through analytical reasoning and numerical evaluation, the study validates the bound for various k values, demonstrating its precision and general applicability. Furthermore, an application to the finiteness of integer representations as linear combinations of k-bonacci numbers with bounded coefficients is presented. This research emphasizes an accessible, rigorous, and computationally verifiable approach to understanding generalized recurrence growth while providing new avenues for mathematical exploration and practical implementation.
Fields of Study & Subjects
Advanced Mathematical Theories and Applications
Analytic Number Theory Research
Advanced Combinatorial Mathematics
Publication details
- Journal / source
- INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH
- Volume
- 14
- Issue
- 03
- Publication date
- 28 March 2026
- Language
- EN