8 citations · 11 across the 3 of their papers we have counts for
4 papers · 1 filter
The Generalized Zeckendorf Game
Paul Baird-Smith, Alyssa Epstein, Kristen Flint +1
Zeckendorf proved that every positive integer can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result, though with a different notion of a legal…
The Zeckendorf Game
Paul Baird-Smith, Alyssa Epstein, Kristen Flint +1
Zeckendorf proved that every positive integer can be written uniquely as the sum of non-adjacent Fibonacci numbers. We use this to create a two-player game. Given a fixed integ…
On algorithms to calculate integer complexity
Katherine Cordwell, Alyssa Epstein, Anand Hemmady +5
We consider a problem first proposed by Mahler and Popken in 1953 and later developed by Coppersmith, Erdős, Guy, Isbell, Selfridge, and others. Let be the complexity of $n…
On Near Perfect Numbers
Peter Cohen, Katherine Cordwell, Alyssa Epstein +3
The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures i…