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


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


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