Difference between revisions of "2004 AIME I Problems/Problem 3"
m (→See also) |
I like pie (talk | contribs) m (AIME box) |
||
Line 6: | Line 6: | ||
== See also == | == See also == | ||
− | + | {{AIME box|year=2004|n=I|num-b=2|num-a=4}} | |
− | |||
− | |||
− | |||
− |
Revision as of 15:00, 27 April 2008
Problem
A convex polyhedron has 26 vertices, 60 edges, and 36 faces, 24 of which are triangular and 12 of which are quadrilaterals. A space diagonal is a line segment connecting two non-adjacent vertices that do not belong to the same face. How many space diagonals does have?
Solution
Every pair of vertices of the polyhedron determines either an edge, a face diagonal or a space diagonal. We have total line segments determined by the vertices. Of these, 60 are edges. Each triangular face has 0 face diagonals and each quadrilateral face has 2, so there are face diagonals. This leaves segments to be the space diagonals.
See also
2004 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |