Several diagonals (possibly intersecting each other) are drawn in a convex n-gon in such a way that no three diagonals intersect in one point. If the n-gon is cut into triangles, what is the maximum possible number of these triangles?
Source:
Tags:
Several diagonals (possibly intersecting each other) are drawn in a convex n-gon in such a way that no three diagonals intersect in one point. If the n-gon is cut into triangles, what is the maximum possible number of these triangles?