Simple Train Journeys
Well, here's a train route. The train starts at the top and makes a number of visits to the stations.
Now let's suppose that the train is going to make visits to three stations (they do not have to be different stations - each station can be visited several times!).
So the first station would be Dorby - this will always be the case! (Why?)
Then the train can go on to Ender. When at Ender it could return and visit Dorby again OR it could go on to Floorin.
So two different journeys:
Dorby - Ender - Floorin
Dorby - Ender - Dorby
Your challenge is to find all the different journeys for visiting four stations.
You could then go on to find all the different journeys for visiting more stations - try five.
How about six stations?
Can you predict the number of different journeys for visiting seven stations? Were you right?
How would you predict the number of different journeys for visiting eight stations?
You might like to then invent your own routes that may go further than this one and then answer similar questions that you can think up.
and so on ...
Encourage the class to look carefully at how the number of different journeys in each case is related to the number of different journeys for smaller numbers of station visits. Once they have identified the pattern, ask them to think about why the pattern occurs.
Making up their own rail networks and investigating them with similar questions would be a good next step. Alternatively, you could challenge them to devise networks with certain criteria.