2000 character limit reached
Fixed-Term Decompositions Using Even-Indexed Fibonacci Numbers
Published 3 Dec 2024 in math.GM | (2501.03231v1)
Abstract: As a variant of Zeckendorf's theorem, Chung and Graham proved that every positive integer can be uniquely decomposed into a sum of even-indexed Fibonacci numbers, whose coefficients are either $0, 1$, or $2$ so that between two coefficients $2$, there must be a coefficient $0$. This paper characterizes all positive integers that do not have $F_{2k}$ ($k\ge 1$) in their decompositions. This continues the work of Kimberling, Carlitz et al., Dekking, and Griffiths, to name a few, who studied such a characterization for Zeckendorf decomposition.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.