olymmath

BxMO 2011 Problem 4

  • Answer

Abby and Brian play the following game: They first choose a positive integer NN. Then they write numbers on a blackboard in turn. Abby starts by writing a 1. Thereafter, when one of them has written the number nn, the other writes down either n+1n+1 or 2n2 n, provided that the number is not greater than NN. The player who writes NN on the blackboard wins. (a) Determine which player has a winning strategy if N=2011N=2011. (b) Find the number of positive integers N⩽2011N \leqslant 2011 for which Brian has a winning strategy.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

31

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

Locator benelux/2011/p4 · Tag 6C27FBJPA5 · Edit this page on GitHub · Keys: j next, k previous