Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Math Forum » Discussions » Math Topics » geometry.pre-college.independent

Topic: Cube/Spider Problem Please Help..
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  

Posts: 2
From: USA
Registered: 3/20/07
Cube/Spider Problem Please Help..
Posted: Mar 20, 2007 3:07 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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)

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 S-A-B-F...how many other ways can u find?
Please post the possible ways,too


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2015. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.