Four Colour Theorem

Show that no more than four colours are required to colour the regions of the map or pattern so that no two adjacent regions have the same colour

Squiggle Rectangles Polygons United States


Click on the regions to fill them with paint. The challenge is to ensure that two regions sharing a border are not filled with the same colour.

Click the 'Check' button when you think you have finished colouring in all of the regions. You can earn a Transum Trophy for getting the colouring correct.

The solutions to this and other Transum puzzles, exercises and activities are available in this space when you are signed in to your Transum subscription account. If you do not yet have an account and you are a teacher or parent you can apply for one here.

A Transum subscription also gives you access to the 'Class Admin' student management system and opens up ad-free access to the Transum website for you and your pupils.


Friday, November 13, 2015

"The Four Colour Theorem states that it will take no more than four different colours to colour a map or similar diagram so that no two regions sharing a border are coloured in the same colour. The first statement of the Four Colour Theorem appeared in 1852 but surprisingly it wasn’t until 1976 that it was proved with the aid of a computer. A simpler computer-aided proof was published in 1997 and in 2005, the theorem was proven by mathematician Georges Gonthier with general purpose theorem proving software."

Do you have any comments? It is always useful to receive feedback and helps make this free resource even more useful for those learning Mathematics anywhere in the world. Click here to enter your comments.


©1997-2017 WWW.TRANSUM.ORG