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


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


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