Question 57
A convex $2011$-gon is drawn on a blackboard. Pete draws its diagonals one by one so that each diagonal $d$ should intersect (by an interior point) not more than one diagonal drawn before $d$. Find the maximal possible number of diagonals that Pete can draw according to these rules. (S. Berlov)