MathDB
alternately write divisors of 100! on the blackboard

Source: 16-th Hungary-Israel Binational Mathematical Competition 2003

March 30, 2007
greatest common divisorcombinatorics unsolvedcombinatorics

Problem Statement

Two players play the following game. They alternately write divisors of 100!100! on the blackboard, not repeating any of the numbers written before. The player after whose move the greatest common divisor of the written numbers equals 1,1, loses the game. Which player has a winning strategy?