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

Let me Join!
Dismiss

Harvard-MIT Mathematics Tournament #0j4y

Harvard-MIT Mathematics TournamentHard

From module Arc and Chord Relations

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.
CirclesExpected values

Problem

Problem:

Sarah and Hagar play a game of darts. Let O0O_{0} be a circle of radius 11. On the nnth turn, the player whose turn it is throws a dart and hits a point pnp_{n} randomly selected from the points of On−1O_{n-1}. The player then draws the largest circle that is centered at pnp_{n} and contained in On−1O_{n-1}, and calls this circle OnO_{n}. The player then colors every point that is inside On−1O_{n-1} but not inside OnO_{n} her color. Sarah goes first, and the two players alternate turns. Play continues indefinitely. If Sarah's color is red, and Hagar's color is blue, what is the expected value of the area of the set of points colored red?

← Back to all problems