Difference between revisions of "2023 AMC 12A Problems/Problem 21"
m (→Problem) |
(→Solution 1) |
||
Line 3: | Line 3: | ||
==Solution 1== | ==Solution 1== | ||
+ | First, note that a regular icosahedron has 12 vertices. So there are <math>{}_{12}P_{3} = 1320</math> ways to choose 3 distinct points. | ||
+ | Now, the furthest distance we can get from one point to another point in a icosahedron is 3. Which gives us a range of <math>1 ≤ d(Q, R), d(R, S) ≤ 3</math> | ||
+ | With some case work, we get: | ||
+ | ''Case 1: <math>d(Q, R)=3; d(R, S)=1,2</math>'' | ||
+ | <math>12×1×10=120</math> | ||
+ | ''Case 2: <math>d(Q, R)=2; d(R, S)=1</math>'' | ||
+ | <math>12×5×5=300</math> | ||
+ | Hence, <math>P(d(Q, R)>d(R, S)) = \frac{120+300}{1320} = \frac{7}{22}</math> | ||
==See also== | ==See also== |
Revision as of 21:10, 9 November 2023
Problem
If and are vertices of a polyhedron, define the distance to be the minimum number of edges of the polyhedron one must traverse in order to connect and . For example, if is an edge of the polyhedron, then , but if and are edges and is not an edge, then . Let Q, R, and S be randomly chosen distinct vertices of a regular icosahedron (regular polyhedron made up of 20 equilateral triangles). What is the probability that ?
Solution 1
First, note that a regular icosahedron has 12 vertices. So there are ways to choose 3 distinct points. Now, the furthest distance we can get from one point to another point in a icosahedron is 3. Which gives us a range of $1 ≤ d(Q, R), d(R, S) ≤ 3$ (Error compiling LaTeX. Unknown error_msg) With some case work, we get: Case 1: Case 2: Hence,
See also
2023 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 20 |
Followed by Problem 22 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.