Copyright © University of Cambridge. All rights reserved.
'Journeys' printed from http://nrich.maths.org/
Here is a simple map showing the positions of five cities:
We could be making some car journeys between these towns and so here is a chart giving us some information about distances and times.
These numbers show us direct routes. But now, suppose we go on journeys involving three or four cities.
For example, we could go from Nodo to Oxdo but go through Cado on the way.
Or, we could go from Lodo to Ledo but go through Oxdo on the way.
What other journeys involving three or four cities can you find?
When you have some of these answer these questions:
1. What is the total distance of your journey in kilometres?
2. How many minutes long is your journey?
3. How much longer (in terms of time) is the journey when passing through another city or other cities along the way compared with the direct journey between the starting city and the final destination?
Now you could try and find the longest route (in terms of distance) for visiting all five cities. (We might decide that we will only visit each city once.)
What about the shortest route for visiting all five cities?
How much longer does it take to travel the longest route compared with the shortest route?