SMC 2014 Q2
2. The diagram shows 6 regions. Each of the regions is to be painted a single colour, so that no two regions sharing an edge have the same colour. What is the smallest number of colours required?
- A 2
- B 3
- C 4
- D 5
- E 6

Senior Mathematical Challenge 2014, Question 2. © UK Mathematics Trust. Original paper on ukmt.org.uk
Answer: B 3
There are points on the diagram, such as \(A\), where the edges of three regions meet, so three or more different colours are required.
A colouring with three colours is possible as shown, so the smallest number of colours required is three.

Solution © UK Mathematics Trust, from the SMC 2014 solutions. Longer versions with investigations: Solutions and investigations (PDF).