olymmath

HMMT 2011 T1

  • Team 1

Alice and Barbara play a game on a blackboard. At the start, zero is written on the board. Alice goes first, and the players alternate turns. On her turn, each player replaces xx - the number written on the board - with any real number yy, subject to the constraint that 0<y−x<10<y-x<1. (a) [10] If the first player to write a number greater than or equal to 2010 wins, determine, with proof, who has the winning strategy. (b) [10] If the first player to write a number greater than or equal to 2010 on her 2011th turn or later wins (if a player writes a number greater than or equal to 2010 on her 2010th turn or earlier, she loses immediately), determine, with proof, who has the winning strategy.

Dataset text NuminaMath olympiads. 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 hmmt/2011/t1 · Tag 2VPPHMBX1J · Edit this page on GitHub · Keys: j next, k previous