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


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


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