Browse · MATH
Printjmc
counting and probability intermediate
Problem
How many different three-step paths along the edges of a cube are there that take you from vertex to vertex ? (A step is from a vertex to an adjacent vertex sharing an edge.)

Solution
There are points we can get to from . Each of these connects to two points adjacent to and to . We can't go back to and then get to in one step, but we can choose either of the other two points. So there are paths from to .
Final answer
6