MathDB
2015 Fall Team #1

Source:

March 26, 2022
combinatoricsgeometry

Problem Statement

33 players take turns drawing lines that connect vertices of a regular nn-gon. No player may draw a line that intersects another line at a point other than a vertex of the n−n-gon. The last player able to draw a line wins. For how many nn in the range 4≤n≤1004\le n \le 100 does the first player have a winning strategy?
Back to ProblemsView on AoPS