Let n≥3 be a positive integer. In the plane n points which are not all collinear are marked. Find the least possible number of triangles whose vertices are all marked. (Recall that the vertices of a triangle are not collinear.)
combinatorial geometrycombinatorics