Join the USAMO Guide Discord Server. Regular updates are posted there!

Let me Join!
Dismiss

Berkeley Math Circle: Monthly Contest 8 #0hr8

Berkeley Math Circle: Monthly Contest 8Hard

From module Strategy and Write-up Structure

Community difficultyNo ratings yetBe the first to rate this problem.
Understand the scale
Scale 0.5: Easiest math competition problems, often solvable even for early middle school students without experience. 1: Problems strictly for beginners, often at a moderate middle school level. 1.5: Problems for stronger beginner students, on the level of the middling problems in most middle school contests. 2: For motivated beginners, harder questions from the previous categories. 2.5: More advanced beginner problems, hardest questions from previous categories. 3: Early intermediate problems that require more creative thinking. 3.5: Tougher early intermediate problems that consistently stretch into higher-level creative thinking or conceptual knowledge. 4: Intermediate-level problems. 4.5: Upper intermediate problems approaching the upper bound for non-invitational sprint math competitions. 5: More difficult AIME problems or simple proof-based Olympiad-style problems. 6: High-level AIME-styled questions or introductory Olympiad-level questions. 7: Tougher Olympiad-level questions, may require more technical knowledge. 8: High-level Olympiad-level questions. 9: Expert Olympiad-level questions. 9.5: The hardest problems appearing on Olympiads which the strongest students could reasonably solve. 10: Historically notorious problems, generally unsuitable for even very hard competitions because they are exceedingly tedious, long, and difficult.
Games / greedy algorithmsInvariants / monovariants

Problem

Problem:

Aerith and Bob take turns picking a nonnegative integer, each time changing exactly one digit from the other's last number. The first person to pick a number that (s)he picked before loses. If Aerith goes first, and both play optimally, who wins?

(Note: There are no leading zeroes, except in the number 00 itself. For instance, if one person picks 20202020, the other could respond by picking 0020=200020=20, however the reverse does not hold.)

← Back to all problems