Difference between revisions of "2008 UNCO Math Contest II Problems/Problem 4"
(→Solution) |
|||
Line 21: | Line 21: | ||
== Solution == | == Solution == | ||
− | + | (a) <math>3\binom{10}{2}</math> (b) <math>3\binom{n+2}{2}=\frac{3(n+1)(n+2)}{2}</math> | |
== See Also == | == See Also == |
Latest revision as of 02:01, 13 January 2019
Problem
In the figure there are line segments drawn from
vertex
to the base
(not counting the segments
or
).
(a) Determine the total number of triangles of all sizes.
(b) How many triangles are there if there are lines
drawn from
to
interior points on
?
Solution
(a) (b)
See Also
2008 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
All UNCO Math Contest Problems and Solutions |