Combinatorics · Combinatorial games · Chomp · Divisor lattice · Winning strategy

Problem 2, 2000

← Prev · 69 / 127 · Next →

RegionalProof

Miljan and Mladen play the following game. They take turns naming divisors of \(200\), with one restriction: the number a player names must not be a divisor of any number named earlier in the game. A player loses as soon as he names \(200\). Miljan goes first. How should he play in order to beat Mladen?

Sign in to check answers, open hints, read the full solution, and track your progress. Statements are always free.

Serbian Regional Competition (Okruzno takmicenje) 2000, high school grade I, category A, problem 2. Organized by the Mathematical Society of Serbia (DMS). Source