Please help me with the problem for my upcoming Combinatorics test:
A moth starts at vertex A of a certain cube and is trying to get to vertex B, which is
opposite A, in five or fewer “steps,” where a step consists in traveling along an edge
from one vertex to another. The moth will stop as soon as it reaches B. How many
ways can the moth achieve its objective?
This is a classic ill-defined problem.
Is it possible for the moth to go DLU, down-left-up?
You see that if that were possible then it may be possible to never complete the trip.
There is idea of a progressive trip. Is that what you mean?
Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics. Register to post your math questions or just hang out and try some of our math games or visit the arcade.
Combinatorics 
Linear Mode
