March 24, 2020
Problem of the Week
Tuesday, March 24, 2020
A bug is on the top face of a standard die, sitting on the side marked "one". He wishes to crawl to the opposite side marked "six" by passing through a sequence of adjacent faces in such a way that he visits no face more than once and ends up at "six". How many different paths can he take?