Problem #WSP-000212

Problems Discrete Mathematics Algorithm Theory Game theory Winning and loosing positions

Problem

Terry and Janet are playing a game with stones. There are two piles of stones, one has \(m\) stones and the other has \(n\) stones initially. In their turn, a player takes from one pile a positive number of stones that is a multiple of the number of stones in the other pile at that moment. The player who cleans up one of the piles wins. Terry starts - who will win?