Abstract
By Zeckendorf ’s Theorem, every positive integer can be uniquely written as a sum of distinct non-adjacent Fibonacci terms. In this paper, we investigate the asymptotic formula of the number of binary expansions that are less than x and have no adjacent terms, and generalize the result to the setting of general linear recurrences with non-negative integer coefficients.
| Original language | English |
|---|---|
| Article number | A25 |
| Journal | Integers |
| Volume | 25 |
| DOIs | |
| State | Published - 2025 |
Scopus Subject Areas
- Algebra and Number Theory
- Discrete Mathematics and Combinatorics