olymmath

ISL 2004 C5

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

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator isl/2004/c5 · Tag EYGSE4CQE1 · Edit this page on GitHub · Keys: j next, k previous