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


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


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