This was asked to me by a friend. $N$ men sit around a circular table. Man 1 has a sword with him and he kills the Man 2, Man 3 picks up this sword and kills the next person i.e. Man 4. Thus the man ...
I wrote an article on the Social Golfer Problem, which has questions like: Each day, 16 people play Munchkin in foursomes simultaneously. How many days can they play with no two people playing with ...
All possible permutations on a Rubik cube ($3\times3\times 3$) can be reached from the initial state?
If I were to represent a state in the Rubik cube as a permutation of the colors on the 9 tiles per side on all sides of the cube, could I reach all possible states (i.e. colorings) by the permutations ...
I ran across a math puzzle that went like this: Consider the list $1,9,9,3, \cdots$ where the next entry is equal to the sum mod 10 of the prior 4. So the list begins $1,9,9,3,2,3,7,\cdots$. Will ...