Suppose you permute the numbers 1 through 11 amongst themselves on
a clock face, leaving the 12 undisturbed. Then pick a starting
number. Begin a list with this number. Then, move clockwise
around the clockface the number of numbered spots given by the
last number on your list. Add this number to your list. Then
move clockwise the number of spots given by the last number on
the list. Continue in this way until you hit the 12 or a number
which is already on your list. Here's an example.
Suppose you number the clockface clockwise from the 12 as follows:
12,1,4,2,3,5,6,7,8,9,10,11. And you start at the 2. The next
number for the list will be 5, then 10, then 8, etc. Your
list will end up 2,5,10,8,3,7,4,6,12.
Or, suppose you number the clockface clockwise from the 12 as:
12,1,3,2,4,5,6,7,8,9,10,11. And you start at 1. Your list will
then be 1,3,5,10,8,4 and 8 would be next but it is already on the
list.
Can you permute the numbers between 1 and 11, and pick a starting
number, such that your list will contain all 12 numbers?
Interesting fact: Less than .0009% of random permutation/start
combinations will produce a list containing all 12 numbers.