Problem

Source:

Tags: combinatorics, number theory, game, winning strategy



Two players take turns to write natural numbers on a board. The rules forbid writing numbers greater than $p$ and also divisors of previously written numbers. The player who has no move loses. Determine which player has a winning strategy for $p = 10$ and describe this strategy.