distinct points are chosen on a circle and each two of them are connected with a vector going in one of the two possible directions. Let be the number of triangles with the vertices at the given points such that the sum of the vectors going along the sides of the triangle is equal to zero, (i.e. starting from any vertex, the vectors will go back to itself). Find the smallest and the biggest possible values of .
Solution
The smallest and the largest possible values of are and respectively.
Let the points be . If we draw the vector whenever , then for any with , we have
Therefore, it is possible that .
For the maximum value, we call special if it does not have sum . Note that the vectors of a special triangle must be , and up to symmetry. We say that is the initial vertex and is the terminal vertex of this triangle.
For each vertex , suppose there are vectors pointing away from and vectors pointing towards . Note that . Then there are pairs of vectors and , and pairs of vectors and . Therefore, there are special triangles with as initial vertex (note that the vector between and is irrelevant), and special triangles with as terminal vertex. As each special triangle is counted twice, it follows that the number of special triangles is
by Jensen's inequality. Since there are triangles in total, this implies
This maximum value can be attained. For example, suppose we draw the vector for and , where the indices are taken modulo . Then for any , and so equality holds.