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


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


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