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


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


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