Fixed-Term Decompositions Using Even-Indexed Fibonacci Numbers
DOI:
https://doi.org/10.46787/pump.v8i.5669Keywords:
Zeckendorf decomposition; even-indexed Fibonacci numbers; fixed termsAbstract
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 F2k (k ≥ 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.
Downloads
Published
2025-08-11
How to Cite
Chu, H., Kanji, A., & Vasseur, Z. (2025). Fixed-Term Decompositions Using Even-Indexed Fibonacci Numbers. The PUMP Journal of Undergraduate Research, 8, 359–373. https://doi.org/10.46787/pump.v8i.5669
Issue
Section
Articles
License
Copyright (c) 2025 Hung Chu, Aney Kanji, Zachary Vasseur

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The author(s) will retain the copyright, but by submitting the article agree to grant permission to the PUMP Journal of Undergraduate Research to publish, distribute, and archive the article. The author(s) will acknowledge prior publication in the PUMP Journal of Undergraduate Research for all future uses of the article or parts of it.