Questions   
Sort: 
 #3
avatar+118687 
+1

Here is a very old post that you may find very helpful.

 

The original question is a little different from yours so be a little patient with looking at the answers :)

 

https://web2.0calc.com/questions/it-just-doesn-t-make-sense-to-me

 

Actually, if you scroll the the very bottom of this thread you will find there is another link.

You may like it even more :)      It is more attractively presented  wink

 

https://web2.0calc.com/questions/the-result-of-subtracting-a-negetive-integer-from-a-positive-integer-is-a-positve-integer

 

 

For those of you who wonder how I found these, (they are over 3 years old) 

They are in the reference material thread that is in the Sticky Topics :)

Oct 24, 2017
 #3
avatar+118687 
+3

Here is the problem explained

 

https://www.youtube.com/watch?v=SC5CX8drAtU

 

I think the trick is to make the route the thinest polygon possible,  (So no cross overs of the route)

 

So for the 6 cities below I think the shortest route would be to work your way around the yellow hexagon.  This is of course if you are flying directly between the cities.  laugh

 

Oct 24, 2017

1 Online Users

avatar