AMC 10 Step by Step

2023 AMC 10A Problem 25

P21-25~8 minPrint

If AA and BB are vertices of a polyhedron, define the distance d(A,B)d(A, B) to be the minimum number of edges of the polyhedron one must traverse in order to connect AA and BB . For example, AB‾\overline{AB} is an edge of the polyhedron, then d(A,B)=1d(A, B) = 1 , but if AC‾\overline{AC} and CB‾\overline{CB} are edges and AB‾\overline{AB} is not an edge, then d(A,B)=2d(A, B) = 2 . Let QQ , RR , and SS be randomly chosen distinct vertices of a regular icosahedron (regular polyhedron made up of 2020 equilateral triangles). What is the probability that d(Q,R)>d(R,S)d(Q, R) > d(R, S) ?

Log in to save your progress.
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 RR first. Every vertex of the icosahedron looks the same, so it does not matter which vertex RR is. What matters is how far QQ and SS are from RR.
2. Sort the other vertices by distance from RR. The icosahedron has 1212 vertices, and 55 edges meet at each one.
- Distance 11: the 55 neighbors of RR.
- Distance 33: the 11 vertex directly opposite RR (at the far end of the solid).
- Distance 22: everything else, 12−1−5−1=512 - 1 - 5 - 1 = 5 vertices. (Picture the icosahedron as a top vertex, a ring of 55, a second ring of 55, and a bottom vertex.)

distance from RR123
number of vertices551

3. Count all choices of QQ and SS. They are two different vertices from the other 1111, in order: 11×10=11011 \times 10 = 110 ways.
4. Count the ways QQ is farther than SS.
- QQ at distance 22, SS at distance 11: 5×5=255 \times 5 = 25 ways.
- QQ at distance 33, SS at distance 11 or 22: 1×10=101 \times 10 = 10 ways.

Total: 25+10=3525 + 10 = 35 ways.
5. Probability:
35110=722.\frac{35}{110} = \frac{7}{22}.

The answer is (A) 722\boxed{\textbf{(A)}\ \frac{7}{22}}.

Why this works

A hard-looking 3D question turns into a table once you stand at one vertex and sort the rest by distance: 5,5,15, 5, 1. After that it is just counting ordered pairs. It also helps to notice that QQ and SS play the same role, so "QQ farther" and "SS farther" are equally likely, and the only reason the answer is not 12\frac12 is the chance of a tie.

Alternative approach

Use that symmetry directly. Count the ties: both QQ and SS at distance 11 gives 5×4=205 \times 4 = 20 ordered pairs, both at distance 22 gives another 2020, and both at distance 33 is impossible (only one vertex). So a tie has probability 40110=411\frac{40}{110} = \frac{4}{11}. The remaining 711\frac{7}{11} is split equally between "QQ farther" and "SS farther," so the answer is 12×711=722\frac12 \times \frac{7}{11} = \frac{7}{22}.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

Fix RR. The roles of QQ and SS are interchangeable, so d(Q,R)>d(R,S)d(Q,R) > d(R,S) and d(Q,R)<d(R,S)d(Q,R) < d(R,S) are equally likely. Therefore
P(d(Q,R)>d(R,S))=1−P(tie)2.P\big(d(Q,R) > d(R,S)\big) = \frac{1 - P(\text{tie})}{2}.

Distances from a vertex of the icosahedron: it has 1212 vertices, and each vertex has 55 neighbors (distance 11). The vertex directly opposite is at distance 33, and the remaining 12−1−5−1=512 - 1 - 5 - 1 = 5 vertices are at distance 22. So from RR the other 1111 vertices split as 5,5,15, 5, 1 at distances 1,2,31, 2, 3.

QQ and SS are two distinct vertices chosen from these 1111, giving 11⋅10=11011 \cdot 10 = 110 ordered pairs. Ties occur when both lie in the same layer: 5⋅4=205 \cdot 4 = 20 pairs at distance 11, 5⋅4=205 \cdot 4 = 20 at distance 22, and 1⋅0=01 \cdot 0 = 0 at distance 33. So
P(tie)=40110=411,P(d(Q,R)>d(R,S))=1−4112=722.P(\text{tie}) = \frac{40}{110} = \frac{4}{11}, \qquad P\big(d(Q,R) > d(R,S)\big) = \frac{1 - \frac{4}{11}}{2} = \frac{7}{22}.

The answer is (A) 722\boxed{\textbf{(A)}\ \frac{7}{22}}.

Review in the AoPS books

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.