A bug can move along one edge of an icosahedron every 10 seconds. How many ways are there for it to move from one vertex to the opposite vertex in 30 seconds?
Image credit: http://home.btconnect.com/
Check out my other problems
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There are 5 ways to select an initial path from an end vertex, then 2 ways after moving through one edge/ for 10 seconds, and only 1 way to reach the opposite vertex Therefore number of ways = 5.2.1 =10