100693 – We Solve Problems

Problem № 100693

Tom found a large, old clock face and put 12 sweets on the number 12. Then he started to play a game with himself. In each move he moves one sweet to the next number clockwise, and some other to the next number anticlockwise. Is it possible that after finite number of steps there is exactly 1 of the sweets on each number?


Add to My Problems
My Problem Set reset
No Problems selected
Print Collection