Reply
Mon 18 Sep, 2006 11:07 pm
In mathematica country 1,2,3,4...8,9 are nine cities. Cities that form a number that is divisible by 3 are connected by airplanes. (e.g. cities 1 & 2 form number 12, which divisible by 3 then 1 is connected to city 2). Find the total number of ways you can go to 8 if you are allowed to break the journeys.
__OHH__
go to 8 from where?
can u repeat paths?
from 2 to 1....from 1 to 8
from 1 to 2 to 1 to 8
from 2 to 1 to 2 to 1 to 8...
the answer is infinate if u can do that
There are three sets of cities:
A: 1, 4, 7
B: 2, 5, 8
C: 3, 6, 9
You can travel back and forth between sets A and B, but you can only travel within set C.
If you start in C, the answer is zero.
You can get from anywhere in A to 8 in one hop.
You can get from anwhere in B to 8 in two hops.
Where do you start?
Can you visit a city more than once?
Can you travel on the same flight more than once?
What does it mean to "break the journeys?"
Stumble It!
Tweet This
Bookmark on Delicious
Share on Facebook
Share on MySpace