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 

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

Sunday Afternoon Maths LXVI

Cryptic crossnumber #2

Sunday Afternoon Maths LXV

Cryptic crossnumber #1
Breaking Chocolate
Square and cube endings

List of all puzzles


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


Show me a random puzzle
▼ show ▼
© Matthew Scroggs 2019