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


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


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