Problem

Source: Belarusian MO 2022

Tags: combinatorics



$2021$ points are marked on a circle. $2021$ segments with marked endpoints are drawn. After that one counts the number of different points where some $2$ drawn segments intersect(endpoints of segments do not count as intersections) Find the maximum number one can get.