2011-gon
Source: All-Russian 2011
May 17, 2011
inductionfloor functioncombinatorics proposedcombinatorics
Problem Statement
A convex 2011-gon is drawn on the board. Peter keeps drawing its diagonals in such a way, that each newly drawn diagonal intersected no more than one of the already drawn diagonals. What is the greatest number of diagonals that Peter can draw?