Draw a regular polygon. Connect all its vertices to every other vertex. For example, if you picked a pentagon or a hexagon, the result would look as follows:
Colour the regions of your shape so that no two regions which share an edge are the same colour. (Regions which only meet at one point can be the same colour.)
What is the least number of colours which this can be done with?

Show answer & extension


Show me a random puzzle
 Most recent collections 

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

Sunday Afternoon Maths LXVI

Cryptic crossnumber #2

Sunday Afternoon Maths LXV

Cryptic crossnumber #1
Breaking Chocolate
Square and cube endings

List of all puzzles


quadratics dates dodecagons dice taxicab geometry ellipses chess shape graphs proportion division digits sport time differentiation mean palindromes numbers means grids surds wordplay cube numbers indices pascal's triangle algebra balancing money speed folding tube maps hexagons 2d shapes spheres prime numbers calculus multiples partitions factors arrows odd numbers probabilty circles square numbers volume crosswords parabolas sum to infinity floors percentages coordinates cryptic clues rectangles christmas square roots doubling games crossnumbers star numbers symmetry averages planes factorials people maths chalkdust crossnumber routes advent cryptic crossnumbers irreducible numbers triangles sums shapes 3d shapes rugby integers clocks colouring addition integration polygons bases angles geometry fractions scales multiplication functions regular shapes ave coins triangle numbers chocolate trigonometry sequences perimeter unit fractions squares area cards menace probability perfect numbers number logic books remainders lines complex numbers


Show me a random puzzle
▼ show ▼
© Matthew Scroggs 2012–2019