2023 AMC 10A Problem 25
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, is an edge of the polyhedron, then , but if and are edges and is not an edge, then . Let , , and be randomly chosen distinct vertices of a regular icosahedron (regular polyhedron made up of equilateral triangles). What is the probability that ?
Show solution without answering
Key insight
Stand at R and sort the other 11 vertices by distance: 5 at distance 1, 5 at distance 2, 1 at distance 3. Then count pairs.
Solution
1. Fix first. Every vertex of the icosahedron looks the same, so it does not matter which vertex is. What matters is how far and are from .
2. Sort the other vertices by distance from . The icosahedron has vertices, and edges meet at each one.
- Distance : the neighbors of .
- Distance : the vertex directly opposite (at the far end of the solid).
- Distance : everything else, vertices. (Picture the icosahedron as a top vertex, a ring of , a second ring of , and a bottom vertex.)
| distance from | 1 | 2 | 3 |
|---|---|---|---|
| number of vertices | 5 | 5 | 1 |
3. Count all choices of and . They are two different vertices from the other , in order: ways.
4. Count the ways is farther than .
- at distance , at distance : ways.
- at distance , at distance or : ways.
Total: ways.
5. Probability:
The answer is .
Why this works
A hard-looking 3D question turns into a table once you stand at one vertex and sort the rest by distance: . After that it is just counting ordered pairs. It also helps to notice that and play the same role, so " farther" and " farther" are equally likely, and the only reason the answer is not is the chance of a tie.
Alternative approach
Use that symmetry directly. Count the ties: both and at distance gives ordered pairs, both at distance gives another , and both at distance is impossible (only one vertex). So a tie has probability . The remaining is split equally between " farther" and " farther," so the answer is .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Fix . The roles of and are interchangeable, so and are equally likely. Therefore
Distances from a vertex of the icosahedron: it has vertices, and each vertex has neighbors (distance ). The vertex directly opposite is at distance , and the remaining vertices are at distance . So from the other vertices split as at distances .
and are two distinct vertices chosen from these , giving ordered pairs. Ties occur when both lie in the same layer: pairs at distance , at distance , and at distance . So
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 7: Introduction to Probability
- Introduction to Geometry, Chapter 14: Three-Dimensional Geometry
- Introduction to Algebra, Chapter 22: Special Manipulations (§22.3)
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.3)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.