Island Hopping
Neda decided to take the ferry from the mainland to visit the four islands $P$, $Q$, $R$ and $S$.
The island $Q$ can be reached by ferry only from island $P$ or from the mainland. Ferries connect islands $P$ and $R$, and each of them with the mainland. Island $S$ only has a ferry connection with island $P$.
What is the smallest number of ferry journeys that Neda needs to take in order to visit all the islands and return to the mainland.
If you liked this problem, here is an NRICH task which challenges you to use similar mathematical ideas.
You may also like
Consecutive Numbers
An investigation involving adding and subtracting sets of consecutive numbers. Lots to find out, lots to explore.
Tea Cups
Place the 16 different combinations of cup/saucer in this 4 by 4 arrangement so that no row or column contains more than one cup or saucer of the same colour.
Counting on Letters
The letters of the word ABACUS have been arranged in the shape of a triangle. How many different ways can you find to read the word ABACUS from this triangular pattern?