Routes and Networks - July 2004, Stage 3&4

Problems

problem icon

Travelling Salesman

Stage: 3 Challenge Level: Challenge Level:1

A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start. How many Hamiltonian circuits can you find in these graphs?

problem icon

Konigsberg Plus

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Euler discussed whether or not it was possible to stroll around Koenigsberg crossing each of its seven bridges exactly once. Experiment with different numbers of islands and bridges.

problem icon

Tourism

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.

problem icon

Lost in Space

Stage: 4 Challenge Level: Challenge Level:1

How many ways are there to count 1 - 2 - 3 in the array of triangular numbers? What happens with larger arrays? Can you predict for any size array?

problem icon

All Tied Up

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

A ribbon runs around a box so that it makes a complete loop with two parallel pieces of ribbon on the top. How long will the ribbon be?

problem icon

The Spider and the Fly

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

A spider is sitting in the middle of one of the smallest walls in a room and a fly is resting beside the window. What is the shortest distance the spider would have to crawl to catch the fly?