A counting based proof of the generalized Zeckendorf's theorem
Tamás Lengyel · The Fibonacci Quarterly · 2006
We give a counting based short proof of the generalized Zeckendorf’s theorem claiming that every positive integer can be uniquely represented as a sum of generalized Fibonacci numbers of order l with no l consecutive indices.