Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.


GK
Posts:
2
From:
USA
Registered:
3/20/07


Cube/Spider Problem Please Help..
Posted:
Mar 20, 2007 3:07 PM


Hi everyone..i really need the answer to this problem so i would really appreciate it if you help me..THANKS
A spider is standing on vertex (S) in this cube. (The cube's 8 vertices? are (S,A,G,B,E,D,C,F) [img]http://www1.filehost.to/files/20070320_03/195358_sss.jpg[/img]
The spider wants to walk to vertex (F), To get there it must follow these rules. 1. The spider can walk only along edges 2. The spider can walk along an edge, once only 3. The spider can only go down the vertical edges, never up 4. The spider can visit any vertex expect (F) more than once. When it gets to F, it must stop. One way to get to F. is SABF...how many other ways can u find? Please post the possible ways,too
tHANK U



