2020 USAMTS Round 1 Problems/Problem 4

Revision as of 13:33, 23 October 2020 by Icematrix2 (talk | contribs) (Created page with "Two beasts, Rosencrans and Gildenstern, play a game. They have a circle with <math>n</math> points (<math>n \geq 5</math>) on it. On their turn, each beast (starting with Rose...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Two beasts, Rosencrans and Gildenstern, play a game. They have a circle with $n$ points ($n \geq 5$) on it. On their turn, each beast (starting with Rosencrans) draws a chord between a pair of points in such a way that any two chords have a shared point. (The chords either intersect or have a common endpoint).

The game ends when a player cannot draw a chord. The last beast to draw a chord wins. For which $n$ does Rosencrans win?