Towards the Gaussianity of Random Zeckendorf Games
Published in Combinatorial and Additive Number Theory (CANT) conference proceedings, 2023
Zeckendorf proved that every positive integer decomposes uniquely as a sum of non-consecutive Fibonacci numbers. Motivated by this, Baird, Epstein, Flint, and Miller defined a two-player Zeckendorf game on multisets of Fibonacci numbers. This paper studies the random variant of that game and gives evidence toward Gaussian behavior of the game length. Joint work from the SMALL REU at Williams.
Recommended citation: Cheigh, J., Dantas e Moura, G. Z., Jeong, R., Lehmann Duke, J., Milgrim, W., Miller, S. J., and Ngamlamai, P. (2023). "Towards the Gaussianity of random Zeckendorf games." Combinatorial and Additive Number Theory (CANT) conference proceedings.
Download Paper