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


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


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