2017 UNCO Math Contest II Problems/Problem 9
Problem
Suppose n points on the circumference of a circle are joined by straight line segments in all possible ways and that no point that is not one of the original n points is contained in more than two of the segments. How many triangles are formed by the segments? Count all triangles whose sides lie along the segments, including triangles that overlap with other triangles. For example, for n = 3, there is one triangle and for n = 4 (shown in the diagram), there are 8 triangles.
Solution
Since any pairwise intersecting lines make a triangle, so we can split the possibilities into cases:
Case 1: All vertices of the triangle are points on the circle
Any points will work, so it's
Case 2: 2 vertices of the triangle are points on the circle
There will be points to choose from, but you also have to multiply by the number of orientations (), so
Case 3: 1 vertex of the triangle is a point on the circle
There will be points to choose from, but you also have to multiply by the number of orientations (), so
Case 4: All vertices of the triangle are points on the circle
Any points will work, so it's
Thus there are a total of different triangles.
See also
2017 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
All UNCO Math Contest Problems and Solutions |