Difference between revisions of "2017 UNCO Math Contest II Problems/Problem 9"
(→Problem) |
(→Solution) |
||
| Line 20: | Line 20: | ||
== Solution == | == Solution == | ||
| + | <math>{n}\choose{6}</math> + 5<math>{n}\choose{5}</math> + 4<math>{n}\choose{4}</math> + <math>{n}\choose{3}</math> | ||
== See also == | == See also == | ||
Revision as of 04:12, 13 January 2019
Problem
![[asy] pair A=dir(0),B=dir(80),C=dir(160),D=dir(310),O=(0,0); draw(circle(O,1),black); draw(A--B--C--D--A--C--B--D); [/asy]](http://latex.artofproblemsolving.com/f/c/7/fc701ad9b432b3bdb5b3c1b0d2d47aa001998149.png)
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
+ 5
+ 4
+ 
See also
| 2017 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 8 |
Followed by Problem 9 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
| All UNCO Math Contest Problems and Solutions | ||
