MathDB
Game

Source: Colombia TST, IMO ShortList 2004, combinatorics problem 5

June 7, 2005
combinatoricsIMO Shortlistgameilostthegamegames

Problem Statement

AA and BB play a game, given an integer NN, AA writes down 11 first, then every player sees the last number written and if it is nn then in his turn he writes n+1n+1 or 2n2n, but his number cannot be bigger than NN. The player who writes NN wins. For which values of NN does BB win?
Proposed by A. Slinko & S. Marshall, New Zealand