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


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


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