Problem

Source: Chile Finals 2014 L2 p3

Tags: combinatorics, combinatorial geometry, points



In the plane there are $2014$ plotted points, such that no $3$ are collinear. For each pair of plotted points, draw the line that passes through them. prove that for every three of marked points there are always two that are separated by an amount odd number of lines.