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?
Select one option, then click Submit.
2
3
4
5
6
Select an option, then submit.
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
Senior Mathematical Challenge 2014 (2014)
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →Senior Mathematical Challenge 2014 (2014)