Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

We have a fair coin, and start at the 12 o'clock marker on a clock. At each step, flip the coin. If heads, move clockwise, if tails move counter-clockwise. As you land on a number, mark that number as visited.

Which number(s) on the clock has the highest probability of being the last one to be visited? Which one has the lowest? Alternatively, what are the probabilities of each number being the last one to be visited?

I ran some simulations in python. The probabilities seem evenly distributed across 2-10 and 12, but half as big for 1 and 11. My intuition tells me that 6 might be the reasonable choice for "most likely to be last", but intuition isn't very good for probability.

share|improve this question
    
Can you show the simulation code? The results you got are highly counter-intuitive (but the intuition, you know...) –  user58697 Mar 13 at 4:38
    
Do you stop after a fixed number of moves? –  awkward Mar 13 at 11:22
    
You stop once everything has been visited. –  Coin_problem_arm Mar 13 at 13:20

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.