olymmath

Putnam 2025 A3

  • Session A

Alice and Bob play a game with a string of nn digits, each of which is restricted to be 00, 11, or 22. Initially all the digits are 00. A legal move is to add or subtract 11 from one digit to create a new string that has not appeared before. A player with no legal move loses, and the other player wins. Alice goes first, and the players alternate moves. For each n≥1n \geq 1, determine which player has a strategy that guarantees winning.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

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

Locator putnam/2025/a3 · Tag 4350EFJQE8 · Edit this page on GitHub · Keys: j next, k previous