Problem #PRU-100623

Problems Set theory and logic Theory of algotithms Game theory Winning and loosing positions

Problem

Nathan and Liam have numbers from \(1\) to \(2018\) written on a board. In each move, one of the players removes a number of their choosing, which is still on the board, together with all its remaining divisors. Liam goes first. The last person to remove a number wins. Who has the winning strategy?