2023 AMC 10A Problems/Problem 25

If A and B are vertices of a polyhedron, define the distance d(A, B) to be the minimum number of edges of the polyhedron one must traverse in order to connect A and B. For example, $\overline{AB}$ is an edge of the polyhedron, then d(A, B) = 1, but if $\overline{AC}$ and $\overline{CB}$ are edges and $\overline{AB}$ is not an edge, then d(A, B) = 2. 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 $d(Q, R) > d(R, S)$ ?

$\textbf{(A) }\frac{7}{22}\qquad\textbf{(B) }\frac{1}{3}\qquad\textbf{(C) }\frac{3}{8}\qquad\textbf{(D) }\frac{5}{12}\qquad\textbf{(E) }\frac{1}{2}$

Video Solution 1 by OmegaLearn

https://youtu.be/Wc6PFNq5PAM

Page

Toolbox

Search

2023 AMC 10A Problems/Problem 25

Video Solution 1 by OmegaLearn