Difference between revisions of "2023 AMC 12A Problems/Problem 21"
(→Solution 2(Cheese+Actual way)) |
|||
Line 27: | Line 27: | ||
In total, there are <math>\binom{12}{3}=220</math> ways to select the points. However, if we look at the denominators of <math>B,C,D</math>, they are <math>3,8,12</math> which are not divisors of <math>220</math>. Also <math>\frac{1}{2}</math> is impossible as cases like <math>d(Q, R) = d(R, S)</math> exist. The only answer choice left is <math>\boxed{A}</math> | In total, there are <math>\binom{12}{3}=220</math> ways to select the points. However, if we look at the denominators of <math>B,C,D</math>, they are <math>3,8,12</math> which are not divisors of <math>220</math>. Also <math>\frac{1}{2}</math> is impossible as cases like <math>d(Q, R) = d(R, S)</math> exist. The only answer choice left is <math>\boxed{A}</math> | ||
+ | |||
(Actual way) | (Actual way) | ||
+ | |||
Fix an arbitrary point, to select the rest <math>2</math> points, there are <math>\binom{11}{2}=55</math> ways. To make <math>d(Q, R)=d(R, S), d=1/2</math>. Which means there are in total <math>2\cdot \binom{5}{2}=20</math> ways to make the distance the same. <math>\frac{1}{2}(1-\frac{20}{55})=\frac{7}{22}\implies \boxed{A}</math> | Fix an arbitrary point, to select the rest <math>2</math> points, there are <math>\binom{11}{2}=55</math> ways. To make <math>d(Q, R)=d(R, S), d=1/2</math>. Which means there are in total <math>2\cdot \binom{5}{2}=20</math> ways to make the distance the same. <math>\frac{1}{2}(1-\frac{20}{55})=\frac{7}{22}\implies \boxed{A}</math> | ||
~bluesoul | ~bluesoul |
Revision as of 22:16, 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
With some case work, we get:
Case 1:
(ways to choose R × ways to choose Q × ways to choose S)
Case 2:
(ways to choose R × ways to choose Q × ways to choose S)
Hence,
~lptoggled
Solution 2(Cheese+Actual way)
In total, there are ways to select the points. However, if we look at the denominators of , they are which are not divisors of . Also is impossible as cases like exist. The only answer choice left is
(Actual way)
Fix an arbitrary point, to select the rest points, there are ways. To make . Which means there are in total ways to make the distance the same. ~bluesoul
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.