You may also like

problem icon

Room Doubling

Investigate the different ways you could split up these rooms so that you have double the number.

problem icon

Fibonacci's Three Wishes 2

Second of two articles about Fibonacci, written for students.

problem icon

Leonardo of Pisa and the Golden Rectangle

Leonardo who?! Well, Leonardo is better known as Fibonacci and this article will tell you some of fascinating things about his famous sequence.

Simple Train Journeys

Stage: 1 and 2 Challenge Level: Challenge Level:1

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!).
Journeys
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.