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


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


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