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 

Advent calendar 2019

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

Sunday Afternoon Maths LXVI

Cryptic crossnumber #2

List of all puzzles


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


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