Let P be a set of n≥3 points in the plane, no three of which are on a line. How many possibilities are there to choose a set T of (2n−1) triangles, whose vertices are all in P, such that each triangle in T has a side that is not a side of any other triangle in T? combinatorics proposedcombinatorics