ASU 256 All Soviet Union MO 1978 game with 2 heaps of checkers
Source:
July 11, 2019
game strategycombinatorics
Problem Statement
Given two heaps of checkers. the bigger contains checkers, the smaller -- (). Two players are taking checkers in turn from the arbitrary heap. The players are allowed to take from the heap a number of checkers (not zero) divisible by the number of checkers in another heap. The player that takes the last checker in any heap wins.
a) Prove that if , than the first can always win. b) Find all such that if , than the first can always win.