Fixed-Term Decompositions Using Even-Indexed Fibonacci Numbers
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.