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


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


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