Select a vertex $V$ of a cube. How many paths begin at $V$, traverse exactly $3$ edges of the cube, and end at the vertex furthest from $V$?
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
Hint: Draw a cube, making sure to include the "invisible" edges. Now take advantage of symmetry. The first step is to any one of $3$ vertices. Pick one of these vertices, say $W$, and count the number of paths of length $2$ that get you where you want to go. Then multiply your count by $3$.