- At least five different coloured pencils or textas
- A copy of a map of Europe [PDF, 133 kB]
The four colour problem
The four colour problem is famous in mathematics. You are given a map divided up into different regions and need to colour it in, following some rules:
- Every region needs to be coloured in a single colour.
- Two regions that share an edge must be coloured different colours. Two regions that only meet at a corner can be coloured the same colour.
- You must use as few colours as possible.
What to do
Use the four colour problem rules to colour a map of Europe. The ocean is all one region, but you might have to colour some countries the same colour as the ocean.
How many colours did you need? Do you think you could do better if you tried again?
Around 150 years ago, Francis Guthrie was colouring a map of the counties of England. He noticed that he only needed four colours to make sure adjacent counties were different colours. For over 100 years, mathematicians puzzled over this observation – could you colour any map with only four colours?
In 1976, Wolfgang Haken and Kenneth Appel used a computer to show that every map can be coloured with only four colours. Since then, other mathematicians have also written proofs, but every proof so far has used a computer.
Although mathematicians have found an answer, there are still many interesting questions you can look into. Can you do the following?
- Draw a map that only needs two colours.
- Create a map with only four regions that needs four different colours.
You can colour any map, on a flat sheet of paper or the surface of a globe, with four colours. However, you might run into problems with maps on more complicated shapes. Maybe you could try drawing a map on an inflatable ring. Can all three-dimensional ring-shaped maps be coloured with four colours? If not, how many colours does it take?