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


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


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