Fixed-Term Decompositions Using Even-Indexed Fibonacci Numbers

Authors

DOI:

https://doi.org/10.46787/pump.v8i.5669

Keywords:

Zeckendorf decomposition; even-indexed Fibonacci numbers; fixed terms

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 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.

Author Biography

Hung Chu, Texas A&M University

Visiting Assistant Professor, Department of Mathematics

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