Explore the surprising variations in conceptually simple sequences of numbers, constructed by applying one of two operations to generate each successive term. Can you make the sequence return to its starting value?
If we give a bunch of children several pieces of candy, and force them to share with their neighbors in a particular way (with no eating or cheating!), what happens? Let’s explore this and other related sharing scenarios.
List all the divisors of N, including 1 and N, and take turns crossing out a divisor (and all of its divisors that are not yet crossed out). Win by forcing your opponent to cross out the final number on the list. Can you come up with a winning strategy?