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 2020

Advent calendar 2019

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

List of all puzzles


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


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