MathDB
Combinatorial game with number choosing

Source: Latvia TST for Baltic Way 2020 P5

October 22, 2020
combinatorics

Problem Statement

Natural numbers 1,2,...,5001,2,...,500 are written on a blackboard. Two players AA and BB consecutively make moves, AA starts. Each move a player chooses two numbers nn and 2n2n and erases them from the blackboard. If a player cannot perform a valid move, he loses. Which player can guarantee a win?
Back to ProblemsView on AoPS